Search

Search Results

• Better Parameter-Free Anytime Search by Minimizing Time Between Solutions

  Jordan Thayer, J. Benton, Malte Helmert

  120-128

  2012-07-19

• Are We There Yet? — Estimating Search Progress

  Jordan Thayer, Roni Stern, Levi Lelis

  129-136

  2012-07-19

• Abstracting Abstraction in Search II: Complexity Analysis

  Christer Backstrom, Peter Jonsson

  10-17

  2012-07-19

• HTN Problem Spaces: Structure, Algorithms, Termination

  Ron Alford, Vikas Shivashankar, Ugur Kuter, Dana Nau

  2-9

  2012-07-19

• Performance Analysis of Planning Portfolios

  Sergio Núñez, Daniel Borrajo, Carlos Linares López

  65-71

  2012-07-19

• Efficient Implementation of Pattern Database Heuristics for Classical Planning

  Silvan Sievers, Manuela Ortlieb, Malte Helmert

  49-56

  2012-07-19

• Search-Aware Conditions for Probably Approximately Correct Heuristic Search

  Roni Stern, Ariel Felner, Robert Holte

  112-119

  2012-07-19

• Bidirectional A* Search with Additive Approximation Bounds

  Michael Rice, Vassilis Tsotras

  80-87

  2012-07-19

• Multimapping Abstractions and Hierarchical Heuristic Search

  Bo Pang, Robert Holte

  72-79

  2012-07-19

• Adaptive Parallelization for Constraint Satisfaction Search

  Xi Yun, Susan Epstein

  145-152

  2012-07-19

• Automatic Move Pruning Revisited

  Neil Burch, Robert Holte

  18-24

  2012-07-19

• Preface

  Daniel Borrajo, Ariel Felner, Richard Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan Sturtevant

  xi-xii

  2012-07-19

• SoCS 2012 Organization

  Maxim Likhachev

  viii-ix

  2012-07-19

• Invited Speakers

  Tristan Cazenave, Stefan Edelkamp

  x

  2012-07-19

• Paper Summary: Time-Bounded Adaptive A*

  Carlos Hernandez, Jorge Baier, Tansel Uras, Sven Koenig

  184-185

  2012-07-19

• Partial-Expansion A* with Selective Node Generation

  Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan Sturtevant, Robert Holte, Jonathan Schaeffer

  180-181

  2012-07-19

• Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract)

  Alex Fukunaga, Akihiro Kishimoto, Adi Botea

  182-183

  2012-07-19

• E-Graphs: Bootstrapping Planning with Experience Graphs

  Mike Phillips, Benjamin Cohen, Sachin Chitta, Maxim Likhachev

  188-189

  2012-07-19

• Efficiently Finding Optimal Winding-Constrained Loops in the Plane: Extended Abstract

  Paul Vernaza, Venkatraman Narayanan, Maxim Likhachev

  200-201

  2012-07-19

• Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract)

  Levi Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert Holte

  186-187

  2012-07-19

• Conflict-Based Search for Optimal Multi-Agent Path Finding

  Guni Sharon, Roni Stern, Ariel Felner, Nathan Sturtevant

  190

  2012-07-19

• MCTS Based on Simple Rerget

  David Tolpin, Solomon Shimony

  193-199

  2012-07-19

• A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints

  Pavel Surynek

  191-192

  2012-07-19

• On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding

  Ko-Hsin Wang, Adi Botea, Philip Kilby

  209-210

  2011-07-15

• Distance Learning in Agent-Centered Heuristic Search

  Nathan Sturtevant

  207-208

  2011-07-15