Abstract is missing.
- On Transposition Tables for Single-Agent Search and Planning: Summary of ResultsYuima Akagi, Akihiro Kishimoto, Alex Fukunaga. 2-9 [doi]
- Additive Heuristic for Four-Connected GridworldsKenneth Anderson. 10-15 [doi]
- Real-Time Search in Dynamic WorldsDavid Bond, Niels A. Widger, Wheeler Ruml, Xiaoxun Sun. 16-22 [doi]
- GPU Exploration of Two-Player Games with Perfect Hash FunctionsStefan Edelkamp, Damian Sulewski, Cengizhan Yücel. 23-30 [doi]
- Heuristic Contraction Hierarchies with Approximation GuaranteeRobert Geisberger, Dennis Schieferdecker. 31-38 [doi]
- Portal-Based True-Distance Heuristics for Path FindingMeir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer. 39-45 [doi]
- Common Misconceptions Concerning Heuristic SearchRobert C. Holte. 46-51 [doi]
- Bootstrap Learning of Heuristic FunctionsShahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte. 52-60 [doi]
- On the Scaling Behavior of HDAAkihiro Kishimoto, Alex Fukunaga, Adi Botea. 61-62 [doi]
- Layer-Abstraction for Symbolically Solving General Two-Player GamesPeter Kissmann, Stefan Edelkamp. 63-70 [doi]
- Objective Functions for Multi-Way Number PartitioningRichard E. Korf. 71-72 [doi]
- Adding Diversity to Classical Heuristic PlanningCarlos Linares López, Daniel Borrajo. 73-80 [doi]
- Improving Local Search for Resource-Constrained PlanningHootan Nakhost, Jörg Hoffmann, Martin Müller 0003. 81-82 [doi]
- Searching for a k-Clique in Unknown GraphsRoni Tzvi Stern, Meir Kalech, Ariel Felner. 83-89 [doi]
- Directed Plateau Search for MAX-k-SATAndrew M. Sutton, Adele E. Howe, L. Darrell Whitley. 90-97 [doi]
- Finding Acceptable Solutions Faster Using Inadmissible InformationJordan Tyler Thayer, Wheeler Ruml. 98-99 [doi]
- Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent PlanningVincent Vidal, Lucas Bordeaux, Youssef Hamadi. 100-107 [doi]
- Landmark Heuristics for the Pancake ProblemMalte Helmert. 109-110 [doi]
- Computing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound SearchEric I. Hsu, Sheila A. McIlraith. 111-112 [doi]
- Potential Search: A New Greedy Anytime Heuristic SearchRoni Tzvi Stern, Rami Puzis, Ariel Felner. 119-120 [doi]
- Anytime Heuristic Search: Frameworks and AlgorithmsJordan Tyler Thayer, Wheeler Ruml. 121-128 [doi]
- A Comparison of Greedy Search AlgorithmsChristopher Makoto Wilt, Jordan Tyler Thayer, Wheeler Ruml. 129-136 [doi]
- Edge Partitioning in Parallel Structured Duplicate DetectionRong Zhou, Tim Schmidt, Eric A. Hansen, Minh Binh Do, Serdar Uckun. 137-138 [doi]
- Cost Based Search Considered HarmfulWilliam Cushing, J. Benton, Subbarao Kambhampati. 140-141 [doi]
- The Logic of Benchmarking: A Case Against State-of-the-Art PerformanceWheeler Ruml. 142-143 [doi]
- Search-Based Path Planning with Homotopy Class ConstraintsSubhrajit Bhattacharya, Vijay Kumar, Maxim Likhachev. 145-146 [doi]
- High-Quality Policies for the Canadian Traveler s ProblemPatrick Eyerich, Thomas Keller, Malte Helmert. 147-148 [doi]
- Evolving Hyper Heuristic-Based Solvers for Rush Hour and FreeCellAmi Hauptman, Achiya Elyasaf, Moshe Sipper. 149-150 [doi]
- Single-Frontier Bidirectional SearchCarsten Moldenhauer, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer. 151-152 [doi]
- Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3DAlex Nash, Sven Koenig, Craig A. Tovey. 153-154 [doi]
- Search Space Reduction Using Swamp HierarchiesNir Pochter, Aviv Zohar, Jeffrey S. Rosenschein, Ariel Felner. 155-156 [doi]
- Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search AlgorithmsRichard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto. 157-158 [doi]