Search

Search Results

• Extended Framework for Target Oriented Network Intelligence Collection

  Liron Samama-Kachko, Rami Puzis, Roni Stern, Ariel Felner

  131-138

  2014-08-15

• Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics

  William Lam, Kalev Kask, Rina Dechter, Alexander Ihler

  105-113

  2014-08-15

• Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem

  Max Barer, Guni Sharon, Roni Stern, Ariel Felner

  19-27

  2014-08-15

• ReACT: Real-Time Algorithm Configuration through Tournaments

  Tadhg Fitzgerald, Yuri Malitsky, Barry O’Sullivan, Kevin Tierney

  62-70

  2014-08-15

• Handling All Unit Propagation Reasons in Exact Max-SAT Solvers

  Andre Abrame, Djamal Habet

  2-9

  2014-08-15

• On the Attainability of NK Landscapes Global Optima

  Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion, Vincent Vigneron

  28-34

  2014-08-15

• Fast First-Move Queries through Run-Length Encoding

  Ben Strasser, Daniel Harabor, Adi Botea

  157-165

  2014-08-15

• Invited Talks

  Sven Koenig, Alexander Reinefeld

  x

  2014-08-15

• Preface

  Stefan Edelkamp, Roman Bartak

  xi-xii

  2014-08-15

• SoCS 2014 Organization

  Stefan Edelkamp, Roman Bartak

  viii-ix

  2014-08-15

• Identifying Hierarchies for Fast Optimal Search

  Tansel Uras, Sven Koenig

  211-212

  2014-08-15

• Multi-Heuristic A*

  Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang, Maxim Likhachev

  207-208

  2014-08-15

• Exponential Deepening A* for Real-Time Agent-Centered Search

  Guni Sharon, Ariel Felner, Nathan Sturtevant

  209-210

  2014-08-15

• Multi-Agent Planning with Mixed-Integer Programming and Adaptive Interaction Constraint Generation (Extended Abstract)

  Jan-P. Calliess, Stephen Roberts

  207-208

  2013-07-11

• Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract)

  Faten Aljalaud, Nathan Sturtevant

  203-204

  2013-07-11

• Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract)

  Hannah Bast, Sabine Storandt

  205-206

  2013-07-11

• The Hierarchy in Grid Graphs (Extended Abstract)

  Sabine Storandt

  209-210

  2013-07-11

• Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search

  Nicolas Rivera, Leon Illanes, Jorge Baier, Carlos Hernandez

  158-166

  2013-07-11

• To UCT, or not to UCT? (Position Paper)

  Carmel Domshlak, Zohar Feldman

  63-70

  2013-07-11

• Planning Paths with Fewer Turns on Grid Maps

  Hu Xu, Lei Shu, May Huang

  193-200

  2013-07-11

• Bounded Suboptimal Heuristic Search in Linear Space

  Matthew Hatem, Roni Stern, Wheeler Ruml

  98-104

  2013-07-11

• Evolving Instance Specific Algorithm Configuration

  Yuri Malitsky, Deepak Mehta, Barry O'Sullivan

  133-140

  2013-07-11

• Anytime Truncated D* : Anytime Replanning with Truncation

  Sandip Aine, Maxim Likhachev

  2-10

  2013-07-11

• Fast Detection of Unsolvable Planning Instances Using Local Consistency

  Christer Bäckström, Peter Jonsson, Simon Ståhlberg

  29-37

  2013-07-11

• Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners

  Mauro Vallati, Chris Fawcett, Alfonso Gerevini, Holger Hoos, Alessandro Saetti

  184-192

  2013-07-11