default search action
9. SOCS 2016: Tarrytown, NY, USA
- Jorge A. Baier, Adi Botea:
Proceedings of the Ninth Annual Symposium on Combinatorial Search, SOCS 2016, Tarrytown, NY, USA, July 6-8, 2016. AAAI Press 2016, ISBN 978-1-57735-769-8
Long Papers
- Yusra Alkhazraji, Martin Wehrle:
Sleep Sets Meet Duplicate Elimination. 2-9 - Vadim Bulitko, Alexander Sampley:
Weighted Lateral Learning in Real-Time Heuristic Search. 10-18 - David A. Cohen, Christopher Jefferson, Karen E. Petrie:
A Theoretical Framework for Constraint Propagator Triggering. 19-27 - Stefan Funke, Sabine Storandt:
Consistent Rounding of Edge Weights in Graphs. 28-35 - Daniel Gilon, Ariel Felner, Roni Stern:
Dynamic Potential Search - A New Bounded Suboptimal Search. 36-44 - Daniel Gnad, Marcel Steinmetz, Mathäus Jany, Jörg Hoffmann, Ivan Serina, Alfonso Gerevini:
Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications. 45-53 - Péter Karkus, Glenn Wagner, Howie Choset:
Recursive Constraint Manifold Subsearch for Multirobot Path Planning with Cooperative Tasks. 54-62 - Levi H. S. Lelis, Richard Anthony Valenzano, Gabriel L. Nazar, Roni Stern:
Searching with a Corrupted Heuristic. 63-71 - Ciaran McCreesh, Patrick Prosser:
Finding Maximum k-Cliques Faster Using Lazy Global Domination. 72-80 - Vitali Sepetnitsky, Ariel Felner, Roni Stern:
Repair Policies for Not Reopening Nodes in Different Search Settings. 81-88 - Ben Stephenson:
A Multi-Phase Search Approach to the LEGO Construction Problem. 89-97 - Tony T. Tran, Minh Do, Eleanor Gilbert Rieffel, Jeremy Frank, Zhihui Wang, Bryan O'Gorman, Davide Venturelli, J. Christopher Beck:
A Hybrid Quantum-Classical Approach to Solving Scheduling Problems. 98-106 - Anirudh Vemula, Katharina Mülling, Jean Oh:
Path Planning in Dynamic Environments with Adaptive Dimensionality. 107-115
Short Papers
- Scott Alfeld, Xiaojin Zhu, Paul Barford:
Machine Teaching as Search. 117-118 - Bruno Bouzy:
Burnt Pancake Problem: New Lower Bounds on the Diameter and New Experimental Optimality Ratios. 119-120 - Vadim Bulitko:
Searching for Real-Time Heuristic Search Algorithms. 121-122 - Tathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar, Subbarao Kambhampati:
Compliant Conditions for Polynomial Time Approximation of Operator Counts. 123-124 - Wenxiang Chen, L. Darrell Whitley, Adele E. Howe, Brian W. Goldman:
Stochastic Local Search over Minterms on Structured SAT Instances. 125-126 - Laura Climent, Barry O'Sullivan, Richard J. Wallace:
An Improved Metaheuristic Algorithm for Maximizing Demand Satisfaction in the Population Harvest Cutting Stock Problem. 127-128 - Skylar R. Croy, Jeremy A. Hansen, Daniel J. McQuillan:
Calculating the Number of Order-6 Magic Squares with Modular Lifting. 129-130 - Bence Cserna, Mike Bogochow, Stephen Chambers, Michaela Tremblay, Sammie Katt, Wheeler Ruml:
Anytime versus Real-Time Heuristic Search for On-Line Planning. 131-132 - Leon Illanes, Sheila A. McIlraith:
Numeric Planning via Search Space Abstraction (Extended Abstract). 133-134 - Gerald Paul, Malte Helmert:
Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis. 135-136 - Tim Schulte, Bernhard Nebel:
Trial-Based Heuristic Tree-search for Distributed Multi-Agent Planning. 137-138 - Guni Sharon, Robert C. Holte, Ariel Felner, Nathan R. Sturtevant:
Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search. 139-140 - Hilla Shinitzky, Roni Tzvi Stern, Meir Kalech:
Batch Repair with Heuristic Search. 141-142 - Nathan R. Sturtevant:
Generalizing JPS Symmetry Detection: Canonical Orderings on Graphs. 143-144 - Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. 145-146
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-25 22:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: