Abstract is missing.
- Sleep Sets Meet Duplicate EliminationYusra Alkhazraji, Martin Wehrle. 2-9 [doi]
- Weighted Lateral Learning in Real-Time Heuristic SearchVadim Bulitko, Alexander Sampley. 10-18 [doi]
- A Theoretical Framework for Constraint Propagator TriggeringDavid A. Cohen, Christopher Jefferson, Karen E. Petrie. 19-27 [doi]
- Consistent Rounding of Edge Weights in GraphsStefan Funke, Sabine Storandt. 28-35 [doi]
- Dynamic Potential Search - A New Bounded Suboptimal SearchDaniel Gilon, Ariel Felner, Roni Stern. 36-44 [doi]
- Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its ApplicationsDaniel Gnad, Marcel Steinmetz, Mathäus Jany, Jörg Hoffmann 0001, Ivan Serina, Alfonso Gerevini. 45-53 [doi]
- Recursive Constraint Manifold Subsearch for Multirobot Path Planning with Cooperative TasksPéter Karkus, Glenn Wagner, Howie Choset. 54-62 [doi]
- Searching with a Corrupted HeuristicLevi H. S. Lelis, Richard Anthony Valenzano, Gabriel Nazar, Roni Stern. 63-71 [doi]
- Finding Maximum k-Cliques Faster Using Lazy Global DominationCiaran McCreesh, Patrick Prosser. 72-80 [doi]
- Repair Policies for Not Reopening Nodes in Different Search SettingsVitali Sepetnitsky, Ariel Felner, Roni Stern. 81-88 [doi]
- A Multi-Phase Search Approach to the LEGO Construction ProblemBen Stephenson. 89-97 [doi]
- A Hybrid Quantum-Classical Approach to Solving Scheduling ProblemsTony T. Tran, Minh Do, Eleanor G. Rieffel, Jeremy Frank, Zhihui Wang, Bryan O'Gorman, Davide Venturelli, J. Christopher Beck. 98-106 [doi]
- Path Planning in Dynamic Environments with Adaptive DimensionalityAnirudh Vemula, Katharina Mülling, Jean Oh. 107-116 [doi]
- Machine Teaching as SearchScott Alfeld, Xiaojin Zhu 0001, Paul Barford. 117-118 [doi]
- Burnt Pancake Problem: New Lower Bounds on the Diameter and New Experimental Optimality RatiosBruno Bouzy. 119-120 [doi]
- Searching for Real-Time Heuristic Search AlgorithmsVadim Bulitko. 121-122 [doi]
- Compliant Conditions for Polynomial Time Approximation of Operator CountsTathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar, Subbarao Kambhampati. 123-124 [doi]
- Stochastic Local Search over Minterms on Structured SAT InstancesWenxiang Chen, L. Darrell Whitley, Adele E. Howe, Brian Goldman. 125-126 [doi]
- An Improved Metaheuristic Algorithm for Maximizing Demand Satisfaction in the Population Harvest Cutting Stock ProblemLaura Climent, Barry O'Sullivan, Richard J. Wallace. 127-128 [doi]
- Calculating the Number of Order-6 Magic Squares with Modular LiftingSkylar R. Croy, Jeremy A. Hansen, Daniel J. McQuillan. 129-130 [doi]
- Anytime versus Real-Time Heuristic Search for On-Line PlanningBence Cserna, Mike Bogochow, Stephen Chambers, Michaela Tremblay, Sammie Katt, Wheeler Ruml. 131-132 [doi]
- Numeric Planning via Search Space Abstraction (Extended Abstract)Leon Illanes, Sheila A. McIlraith. 133-134 [doi]
- Optimal Solitaire Game Solutions Using A* Search and Deadlock AnalysisGerald Paul, Malte Helmert. 135-136 [doi]
- Trial-Based Heuristic Tree-search for Distributed Multi-Agent PlanningTim Schulte, Bernhard Nebel. 137-138 [doi]
- Extended Abstract: An Improved Priority Function for Bidirectional Heuristic SearchGuni Sharon, Robert C. Holte, Ariel Felner, Nathan R. Sturtevant. 139-140 [doi]
- Batch Repair with Heuristic SearchHilla Shinitzky, Ron Tzvi Stern, Meir Kalech. 141-142 [doi]
- Generalizing JPS Symmetry Detection: Canonical Orderings on GraphsNathan R. Sturtevant. 143-144 [doi]
- An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs ObjectivesPavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. 145-147 [doi]