default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th SOCS 2018: Stockholm, Sweden
- Vadim Bulitko, Sabine Storandt:
Proceedings of the Eleventh International Symposium on Combinatorial Search, SOCS 2018, Stockholm, Sweden - 14-15 July 2018. AAAI Press 2018, ISBN 978-1-57735-802-2
Full Papers
- Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding. 2-9 - Dor Atzmon, Roni Stern, Abdallah Saffidine:
Bounded Suboptimal Game Tree Search. 10-18 - Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
:
A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. 19-27 - Michael W. Barley, Patricia J. Riddle, Carlos Linares López, Sean Dobson, Ira Pohl:
GBFHS: A Generalized Breadth-First Heuristic Search Algorithm. 28-36 - Hans Degroote, Patrick De Causmaecker, Bernd Bischl, Lars Kotthoff:
A Regression-Based Methodology for Online Algorithm Selection. 37-45 - Rebecca Eifler, Maximilian Fickert:
Online Refinement of Cartesian Abstraction Heuristics. 46-54 - Daniel Damir Harabor, Peter J. Stuckey:
Forward Search in Contraction Hierarchies. 55-62 - Benjamín Kramm, Nicolas Rivera, Carlos Hernández, Jorge A. Baier:
A Suboptimality Bound for 2k Grid Path Planning. 63-71 - Patrick Rodler, Manuel Herold:
StaticHS: A Variant of Reiter's Hitting Set Tree for Efficient Sequential Diagnosis. 72-80 - Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, Jeffrey S. Rosenschein:
Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics. 81-89 - Silvan Sievers:
Merge-and-Shrink Heuristics for Classical Planning: Efficient Implementation and Partial Abstractions. 90-98 - Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. 99-105 - Tansel Uras, Sven Koenig:
Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs. 106-114 - Hong Xu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar:
Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems. 115-123 - Shizhe Zhao, David Taniar, Daniel Damir Harabor:
Fast k-Nearest Neighbor on a Navigation Mesh. 124-131
Short Papers
- Tomás Balyo, Lukás Chrpa:
Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks. 133-137 - Adi Botea, Akihiro Kishimoto, Radu Marinescu:
On the Complexity of Quantum Circuit Compilation. 138-142 - Daniel Brewer, Nathan R. Sturtevant:
Benchmarks for Pathfinding in 3D Voxel Space. 143-147 - Liron Cohen, Glenn Wagner, David M. Chan, Howie Choset, Nathan R. Sturtevant, Sven Koenig, T. K. Satish Kumar:
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. 148-152 - Ariel Felner:
Position Paper: Using Early Goal Test in A. 153-157 - Maximilian Fickert:
Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning. 158-162 - Shane Kochvi, Wheeler Ruml:
Does Fast Beat Thorough? Comparing RTAA* and LSS-LRTA. 163-167 - Ilia Leybovich, Rami Puzis, Roni Stern, Maor Reuben:
Focused SANA: Speeding Up Network Alignment. 168-172 - Franco Muñoz, Miguel Fadic, Carlos Hernández, Jorge A. Baier:
A Neural Network for Decision Making in Real-Time Heuristic Search. 173-177 - Tim Schulte:
Stubborn Sets Pruning for Privacy Preserving Planning. 178-182
Extended Abstracts
- Tenindra Abeywickrama, Muhammad Aamir Cheema, David Taniar:
k-Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited. 184-185 - Meir Goldenberg:
Extended Abstract: The Heuristic Search Research Framework. 186-187
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-11 00:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
