Search

Search Results

• Multi-Agent Path Finding for Self Interested Agents

  Zahy Bnaya, Roni Stern, Ariel Felner, Roie Zivan, Steven Okamoto

  38-46

  2013-07-11

• An Analysis Framework for Examination Timetabling

  Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim

  11-19

  2013-07-11

• Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases

  André Pereira, Marcus Ritt, Luciana Buriol

  141-148

  2013-07-11

• From Feasibility Tests to Path Planners for Multi-Agent Pathfinding

  Athanasios Krontiris, Ryan Luna, Kostas Bekris

  114-122

  2013-07-11

• Optimal-Generation Variants of EPEA*

  Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Robert C. Holte, Jonathan Schaeffer

  89-97

  2013-07-11

• Bidirectional Preference-Based Search for State Space Graph Problems

  Lucie Galand, Anisse Ismaili, Patrice Perny, Olivier Spanjaard

  80-88

  2013-07-11

• Red-Black Relaxed Plan Heuristics Reloaded

  Michael Katz, Joerg Hoffmann

  105-113

  2013-07-11

• Constrained Symbolic Search: On Mutexes, BDD Minimization and More

  Álvaro Torralba, Vidal Alcázar

  175-183

  2013-07-11

• Experimental Real-Time Heuristic Search Results in a Video Game

  Ethan Burns, Scott Kiesel, Wheeler Ruml

  47-54

  2013-07-11

• Online Detection of Dead States in Real-Time Agent-Centered Search

  Guni Sharon, Nathan Sturtevant, Ariel Felner

  167-174

  2013-07-11

• Parallelising the k-Medoids Clustering Problem Using Space-Partitioning

  Alejandro Arbelaez, Luis Quesada

  20-28

  2013-07-11

• Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics

  Levi Lelis

  123-132

  2013-07-11

• GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials

  Naina Razakarison, Mats Carlsson, Nicolas Beldiceanu, Helmut Simonis

  149-157

  2013-07-11

• Multi-Hop Ride Sharing

  Florian Drews, Dennis Luxen

  71-79

  2013-07-11

• Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates Is Moderate

  John Dickerson, Tuomas Sandholm

  55-62

  2013-07-11

• SoCS 2013 Organization

  Malte Helmert, Gabriele Röger

  viii-ix

  2013-07-11

• Invited Speakers

  J. Beck, Gene Cooperman

  x

  2013-07-11

• Preface

  Malte Helmert, Gabriele Röger

  xi-xii

  2013-07-11

• Target-Value Search Revisited (Extended Abstract)

  Carlos Linares López, Roni Stern, Ariel Felner

  216-217

  2013-07-11

• Polynomial-Time Construction of Contraction Hierarchies for Multi-Criteria Objectives

  Stefan Funke, Sabine Storandt

  214-215

  2013-07-11

• Customizable Route Planning in Road Networks (Extended Abstract)

  Daniel Delling, Andrew Goldberg, Thomas Pajor, Renato Werneck

  212

  2013-07-11

• Candidate Sets for Alternative Routes in Road Networks (Extended Abstract)

  Dennis Luxen, Dennis Schieferdecker

  218-219

  2013-07-11

• Round-Based Public Transit Routing (Extended Abstract)

  Daniel Delling, Thomas Pajor, Renato Werneck

  213

  2013-07-11

• Towards Rational Deployment of Multiple Heuristics in A* (Extended Abstract)

  David Tolpin, Tal Beja, Solomon Eyal Shimony, Ariel Felner, Erez Karpas

  220-221

  2013-07-11

• Position Paper: Incremental Search Algorithms Considered Poorly Understood

  Carlos Hernandez, Jorge Baier, Tansel Uras, Sven Koenig

  159-161

  2012-07-19