Search

Search Results

• Dynamic Potential Search — A New Bounded Suboptimal Search

  Daniel Gilon, Ariel Felner, Roni Stern

  36-44

  2016-07-06

• Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications

  Daniel Gnad, Marcel Steinmetz, Mathäus Jany, Jörg Hoffmann, Ivan Serina, Alfonso Gerevini

  45-53

  2016-07-06

• A Hybrid Quantum-Classical Approach to Solving Scheduling Problems

  Tony Tran, Minh Do, Eleanor Rieffel, Jeremy Frank, Zhihui Wang, Bryan O'Gorman, Davide Venturelli, J. Beck

  98-106

  2016-07-06

• Consistent Rounding of Edge Weights in Graphs

  Stefan Funke, Sabine Storandt

  28-35

  2016-07-06

• A Theoretical Framework for Constraint Propagator Triggering

  David Cohen, Christopher Jefferson, Karen Petrie

  19-27

  2016-07-06

• Finding Maximum k-Cliques Faster Using Lazy Global Domination

  Ciaran McCreesh, Patrick Prosser

  72-80

  2016-07-06

• Path Planning in Dynamic Environments with Adaptive Dimensionality

  Anirudh Vemula, Katharina Muelling, Jean Oh

  107-115

  2016-07-06

• A Multi-Phase Search Approach to the LEGO Construction Problem

  Ben Stephenson

  89-97

  2016-07-06

• Recursive Constraint Manifold Subsearch for Multirobot Path Planning with Cooperative Tasks

  Peter Karkus, Glenn Wagner, Howie Choset

  54-62

  2016-07-06

• Abstracts of Papers Presented at SoCS 2016 in the Previously Published Paper Track

  Jorge Baier, Adi Botea

  148-154

  2016-07-06

• An Empirical Comparison of Any-Angle Path-Planning Algorithms

  Tansel Uras, Sven Koenig

  206-210

  2015-06-11

• Caching in Context-Minimal OR Spaces

  Rina Dechter, Levi Lelis, Lars Otten

  171-175

  2015-06-11

• Computational Tradeoffs of Search Methods for Minimum Constraint Removal Paths

  Athanasios Krontiris, Kostas Bekris

  181-185

  2015-06-11

• Expected Path Degradation when Searching over a Sparse Grid Hierarchy

  Robert Kolchmeyer, Andrew Dobson, Kostas Bekris

  176-180

  2015-06-11

• Confidence Backup Updates for Aggregating MDP State Values in Monte-Carlo Tree Search

  Zahy Bnaya, Alon Palombo, Rami Puzis, Ariel Felner

  156-160

  2015-06-11

• Planning with Always Preferences by Compilation into STRIPS with Action Costs

  Luca Ceriani, Alfonso Gerevini

  161-165

  2015-06-11

• Learning to Search More Efficiently from Experience: A Multi-heuristic Approach

  Sandip Aine, Charupriya Sharma, Maxim Likhachev

  141-145

  2015-06-11

• Feature Selection as State-Space Search: An Empirical Study in Clustering Problems

  Julian Mariño, Levi Lelis

  191-195

  2015-06-11

• Type System Based Rational Lazy IDA*

  Oded Betzalel, Ariel Felner, Solomon Shimony

  151-155

  2015-06-11

• A Preliminary Selection of Problems in Heuristic Search

  Carlos Linares López, Abdallah Saffidine

  186-190

  2015-06-11

• Towards a Reformulation Based Approach for Efficient Numeric Planning: Numeric Outer Entanglements

  Lukáš Chrpa, Enrico Scala, Mauro Vallati

  166-170

  2015-06-11

• No One SATPlan Encoding To Rule Them All

  Tomáš Balyo, Roman Barták

  146-150

  2015-06-11

• Partial Domain Search Tree for Constraint-Satisfaction Problems

  Guni Sharon

  196-200

  2015-06-11

• Maximum a Posteriori Estimation by Search in Probabilistic Programs

  David Tolpin, Frank Wood

  201-205

  2015-06-11

• Automated Transformation of PDDL Representations

  Patricia Riddle, Michael Barley, Santiago Franco, Jordan Douglas

  214-215

  2015-06-11