| Scheduled Conference | Title | |
| Fourth Annual Symposium on Combinatorial Search | A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning | Abstract |
| Tatsuya Imai, Akihiro Kishimoto | ||
| Fourth Annual Symposium on Combinatorial Search | A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems | Abstract |
| Morteza Keshtkaran, Roohollah Taghizadeh, Koorush Ziarati | ||
| Fourth Annual Symposium on Combinatorial Search | A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding | Abstract |
| Mokhtar M. Khorshid, Robert C. Holte, Nathan R. Sturtevant | ||
| Fourth Annual Symposium on Combinatorial Search | A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems | Abstract |
| Lars Kotthoff, Ian P. Gent, Ian Miguel | ||
| Fourth Annual Symposium on Combinatorial Search | Abstract: Block A* and Any-Angle Path-Planning | Abstract |
| Peter Kai Yue Yap, Neil Burch, Robert C. Holte, Jonathan Schaeffer | ||
| Fourth Annual Symposium on Combinatorial Search | Adapting a Rapidly-Exploring Random Tree for Automated Planning | Abstract |
| Vidal Alcázar, Manuela Veloso, Daniel Borrajo | ||
| Fourth Annual Symposium on Combinatorial Search | All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others | Abstract |
| Christer Backstrom, Peter Jonsson | ||
| Fourth Annual Symposium on Combinatorial Search | Anytime AND/OR Depth-First Search for Combinatorial Optimization | Abstract |
| Lars Otten, Rina Dechter | ||
| Fourth Annual Symposium on Combinatorial Search | Automatic Move Pruning in General Single-Player Games | Abstract |
| Neil Burch, Robert C. Holte | ||
| Fourth Annual Symposium on Combinatorial Search | Best-First Search for Bounded-Depth Trees | Abstract |
| Kevin Rose, Ethan Burns, Wheeler Ruml | ||
| Fourth Annual Symposium on Combinatorial Search | Cost-Based Heuristic Search Is Sensitive to the Ratio of Operator Costs | Abstract |
| Christopher Makoto Wilt, Wheeler Ruml | ||
| Fourth Annual Symposium on Combinatorial Search | Deadline-Aware Search Using On-Line Measures of Behavior | Abstract |
| Austin J. Dionne, Jordan Tyler Thayer, Wheeler Ruml | ||
| Fourth Annual Symposium on Combinatorial Search | Degrees of Separation in Social Networks | Abstract |
| Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer | ||
| Fourth Annual Symposium on Combinatorial Search | Distance Learning in Agent-Centered Heuristic Search | Abstract |
| Nathan R. Sturtevant | ||
| Fourth Annual Symposium on Combinatorial Search | Efficient and Complete Centralized Multi-Robot Path Planning | Abstract |
| Ryan Luna, Kostas E. Bekris | ||
| Fourth Annual Symposium on Combinatorial Search | Evolving Solvers for FreeCell and the Sliding-Tile Puzzle | Abstract |
| Achiya Elyasaf, Yael Zaritsky, Ami Hauptman, Moshe Sipper | ||
| Fourth Annual Symposium on Combinatorial Search | Faster Optimal and Suboptimal Hierarchical Search | Abstract |
| Michael J. Leighton, Wheeler Ruml, Robert C. Holte | ||
| Fourth Annual Symposium on Combinatorial Search | Graduated Fidelity Motion Planning | Abstract |
| Mihail Pivtoraiko, Alonzo Kelly | ||
| Fourth Annual Symposium on Combinatorial Search | Improved Prediction of IDA*'s Performance via Epsilon-Truncation | Abstract |
| Levi Lelis, Sandra Zilles, Robert Craig Holte | ||
| Fourth Annual Symposium on Combinatorial Search | On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding | Abstract |
| Ko-Hsin Cindy Wang, Adi Botea, Philip Kilby | ||
| Fourth Annual Symposium on Combinatorial Search | Optimal Packing of High-Precision Rectangles | Abstract |
| Eric Huang, Richard E. Korf | ||
| Fourth Annual Symposium on Combinatorial Search | Path Planning with Adaptive Dimensionality | Abstract |
| Kalin Gochev, Benjamin Cohen, Jonathan Butzke, Alla Safonova, Maxim Likhachev | ||
| Fourth Annual Symposium on Combinatorial Search | Planning for Landing Site Selection in the Aerial Supply Delivery | Abstract |
| Aleksandr Kushleyev, Brian MacAllister, Maxim Likhachev | ||
| Fourth Annual Symposium on Combinatorial Search | Planning in Domains with Cost Function Dependent Actions | Abstract |
| Mike Phillips, Maxim Likhachev | ||
| Fourth Annual Symposium on Combinatorial Search | Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm | Abstract |
| Ariel Felner | ||
| 1 - 25 of 36 Items | 1 2 > >> | |