| A Suboptimality Bound for 2 K Grid Path Planning
|
2018 |
Kramm, Benjamin |
| Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem
|
2018 |
Surynek, Pavel |
| Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks
|
2018 |
Balyo, Tomás |
| Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning
|
2018 |
Fickert, Maximilian |
| Focused SANA: Speeding Up Network Alignment
|
2018 |
Leybovich, Ilia |
| k-Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited
|
2018 |
Abeywickrama, Tenindra |
| Robust Multi-Agent Path Finding
|
2018 |
Atzmon, Dor |
| Forward Search in Contraction Hierarchies
|
2018 |
Harabor, Daniel D. |
| Fast k-Nearest Neighbor on a Navigation Mesh
|
2018 |
Zhao, Shizhe |
| Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems
|
2018 |
Xu, Hong |
| Benchmarks for Pathfinding in 3D Voxel Space
|
2018 |
Brewer, Daniel |
| On the Complexity of Quantum Circuit Compilation
|
2018 |
Botea, Adi |
| Does Fast Beat Thorough? Comparing RTAA* and LSS-LRTA*
|
2018 |
Kochvi, Shane |
| Bounded Suboptimal Game Tree Search
|
2018 |
Atzmon, Dor |
| A Regression-Based Methodology for Online Algorithm Selection
|
2018 |
Degroote, Hans |
| Online Refinement of Cartesian Abstraction Heuristics
|
2018 |
Eifler, Rebecca |
| StaticHS: A Variant of Reiter's Hitting Set Tree for Efficient Sequential Diagnosis
|
2018 |
Rodler, Patrick |
| Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs
|
2018 |
Uras, Tansel |
| Rapid Randomized Restarts for Multi-Agent Path Finding Solvers
|
2018 |
Cohen, Liron |
| A Neural Network for Decision Making in Real-Time Heuristic Search
|
2018 |
Muñoz, Franco |
Tag hinzufügen