|
Scheduled Conference |
Title |
|
Tenth Annual Symposium on Combinatorial Search |
A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs |
Abstract
|
Hong Xu, T. K. Satish Kumar, Sven Koenig |
|
Tenth Annual Symposium on Combinatorial Search |
Abstracts of Papers Presented at SoCS 2017 in the Previously Published Paper Track |
Abstract
|
Alex Fukunaga, Akihiro Kishimoto |
|
Tenth Annual Symposium on Combinatorial Search |
An Analysis and Enhancement of the Gap Heuristic for the Pancake Puzzle |
Abstract
|
Richard Anthony Valenzano, Danniel Sihui Yang |
|
Tenth Annual Symposium on Combinatorial Search |
Better Orders for Saturated Cost Partitioning in Optimal Classical Planning |
Abstract
|
Jendrik Seipp |
|
Tenth Annual Symposium on Combinatorial Search |
Block-Parallel IDA* for GPUs |
Abstract
|
Satoru Horie, Alex Fukunaga |
|
Tenth Annual Symposium on Combinatorial Search |
Boost SAT Solver with Hybrid Branching Heuristic |
Abstract
|
Seongsoo Moon, Mary Inaba |
|
Tenth Annual Symposium on Combinatorial Search |
Cost-Based Heuristics and Node Re-Expansions across the Phase Transition |
Abstract
|
Eldan Cohen, J. Christopher Beck |
|
Tenth Annual Symposium on Combinatorial Search |
Dynamic Potential Search on Weighted Graphs |
Abstract
|
Daniel Gilon, Ariel Felner, Roni Stern |
|
Tenth Annual Symposium on Combinatorial Search |
Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths |
Abstract
|
Shunhao Oh, Hon Wai Leong |
|
Tenth Annual Symposium on Combinatorial Search |
Fast and Almost Optimal Any-Angle Pathfinding Using the 2k Neighborhoods |
Abstract
|
Nicolás Hormazábal, Antonio Díaz, Carlos Hernández, Jorge A. Baier |
|
Tenth Annual Symposium on Combinatorial Search |
Feasibility Study: Subgoal Graphs on State Lattices |
Abstract
|
Tansel Uras, Sven Koenig |
|
Tenth Annual Symposium on Combinatorial Search |
Improving a Planner’s Performance through Online Heuristic Configuration of Domain Models |
Abstract
|
Mauro Vallati, Lukás Chrpa, Thomas Leo McCluskey |
|
Tenth Annual Symposium on Combinatorial Search |
Improving Plan Quality through Heuristics for Guiding and Pruning the Search: A Study Using LAMA |
Abstract
|
Francesco Percassi, Alfonso Emilio Gerevini, Hector Geffner |
|
Tenth Annual Symposium on Combinatorial Search |
Interval Based Relaxation Heuristics for Numeric Planning with Action Costs |
Abstract
|
Johannes Aldinger, Bernhard Nebel |
|
Tenth Annual Symposium on Combinatorial Search |
k-Robust Multi-Agent Path Finding |
Abstract
|
Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng-Fa Zhou |
|
Tenth Annual Symposium on Combinatorial Search |
Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants |
Abstract
|
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski |
|
Tenth Annual Symposium on Combinatorial Search |
Non-Markovian Rewards Expressed in LTL: Guiding Search Via Reward Shaping |
Abstract
|
Alberto Camacho, Oscar Chen, Scott Sanner, Sheila A. McIlraith |
|
Tenth Annual Symposium on Combinatorial Search |
On Realizing Planning Programs in Domains with Dead-End States |
Abstract
|
Federico Falcone, Alfonso E. Gerevini, Alessandro Saetti |
|
Tenth Annual Symposium on Combinatorial Search |
On Variable Dependencies and Compressed Pattern Databases |
Abstract
|
Malte Helmert, Nathan R. Sturtevant, Ariel Felner |
|
Tenth Annual Symposium on Combinatorial Search |
Optimal Solutions to Large Logistics Planning Domain Problems |
Abstract
|
Gerald Paul, Gabriele Röger, Thomas Keller, Malte Helmert |
|
Tenth Annual Symposium on Combinatorial Search |
Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning |
Abstract
|
Maximilian Fickert, Jörg Hoffmann |
|
Tenth Annual Symposium on Combinatorial Search |
Search Reduction through Conservative Abstract-Space Based Heuristic |
Abstract
|
Ishani Chatterjee, Maxim Likhachev, Manuela Veloso |
|
Tenth Annual Symposium on Combinatorial Search |
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges |
Abstract
|
Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan Sturtevant, Glenn Wagner, Pavel Surynek |
|
Tenth Annual Symposium on Combinatorial Search |
Shortest Path for K Goals |
Abstract
|
Roni Tzvi Stern, Meir Goldenberg, Ariel Felner |
|
Tenth Annual Symposium on Combinatorial Search |
Solving Graph Optimization Problems in a Framework for Monte-Carlo Search |
Abstract
|
Stefan Edelkamp, Eike Externest, Sebastian Kühl, Sabine Kuske |
|
1 - 25 of 31 Items |
1 2 > >> |