Search

Search Results

• Stubborn Sets Pruning for Privacy Preserving Planning

  Tim Schulte

  178-182

  2018-07-14

• Focused SANA: Speeding Up Network Alignment

  Ilia Leybovich, Rami Puzis, Roni Stern, Maor Reuben

  168-172

  2018-07-14

• Does Fast Beat Thorough? Comparing RTAA* and LSS-LRTA*

  Shane Kochvi, Wheeler Ruml

  163-167

  2018-07-14

• Benchmarks for Pathfinding in 3D Voxel Space

  Daniel Brewer, Nathan Sturtevant

  143-147

  2018-07-14

• On the Complexity of Quantum Circuit Compilation

  Adi Botea, Akihiro Kishimoto, Radu Marinescu

  138-142

  2018-07-14

• Position Paper: Using Early Goal Test in A*

  Ariel Felner

  153-157

  2018-07-14

• Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks

  Tomáš Balyo, Lukáš Chrpa

  133-137

  2018-07-14

• Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning

  Maximilian Fickert

  158-162

  2018-07-14

• A Suboptimality Bound for 2k Grid Path Planning

  Benjamín Kramm, Nicolas Rivera, Carlos Hernandez, Jorge Baier

  63-71

  2018-07-14

• A Regression-Based Methodology for Online Algorithm Selection

  Hans Degroote, Patrick De Causmaecker, Bernd Bischl, Lars Kotthoff

  37-45

  2018-07-14

• Fast k-Nearest Neighbor on a Navigation Mesh

  Shizhe Zhao, David Taniar, Daniel Harabor

  124-131

  2018-07-14

• Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem

  Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski

  99-105

  2018-07-14

• A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs

  Christer Backstrom, Peter Jonsson, Sebastian Ordyniak

  19-27

  2018-07-14

• Forward Search in Contraction Hierarchies

  Daniel Harabor, Peter Stuckey

  55-62

  2018-07-14

• Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems

  Hong Xu, Cheng Cheng, Sven Koenig, T. K. Kumar

  115-123

  2018-07-14

• GBFHS: A Generalized Breadth-First Heuristic Search Algorithm

  Michael Barley, Patricia Riddle, Carlos Linares López, Sean Dobson, Ira Pohl

  28-36

  2018-07-14

• Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics

  Eshed Shaham, Ariel Felner, Nathan Sturtevant, Jeffrey Rosenschein

  81-89

  2018-07-14

• Merge-and-Shrink Heuristics for Classical Planning: Efficient Implementation and Partial Abstractions

  Silvan Sievers

  90-98

  2018-07-14

• StaticHS: A Variant of Reiter’s Hitting Set Tree for Efficient Sequential Diagnosis

  Patrick Rodler, Manuel Herold

  72-80

  2018-07-14

• Bounded Suboptimal Game Tree Search

  Dor Atzmon, Roni Stern, Abdallah Saffidine

  10-18

  2018-07-14

• Online Refinement of Cartesian Abstraction Heuristics

  Rebecca Eifler, Maximilian Fickert

  46-54

  2018-07-14

• Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs

  Tansel Uras, Sven Koenig

  106-114

  2018-07-14

• Robust Multi-Agent Path Finding

  Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Bartak, Neng-Fa Zhou

  2-9

  2018-07-14

• Extended Abstract: The Heuristic Search Research Framework

  Meir Goldenberg

  186-187

  2018-07-14

• k-Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited

  Tenindra Abeywickrama, Muhammad Cheema, David Taniar

  184-185

  2018-07-14