SOCS B

35 papers

YearTitle / Authors
2010A Comparison of Greedy Search Algorithms.
Christopher Makoto Wilt, Jordan Tyler Thayer, Wheeler Ruml
2010Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning.
Vincent Vidal, Lucas Bordeaux, Youssef Hamadi
2010Adding Diversity to Classical Heuristic Planning.
Carlos Linares López, Daniel Borrajo
2010Additive Heuristic for Four-Connected Gridworlds.
Kenneth Anderson
2010Anytime Heuristic Search: Frameworks and Algorithms.
Jordan Tyler Thayer, Wheeler Ruml
2010Bootstrap Learning of Heuristic Functions.
Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte
2010Common Misconceptions Concerning Heuristic Search.
Robert C. Holte
2010Computing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound Search.
Eric I. Hsu, Sheila A. McIlraith
2010Cost Based Search Considered Harmful.
William Cushing, J. Benton, Subbarao Kambhampati
2010Directed Plateau Search for MAX-k-SAT.
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley
2010Edge Partitioning in Parallel Structured Duplicate Detection.
Rong Zhou, Tim Schmidt, Eric A. Hansen, Minh Binh Do, Serdar Uckun
2010Evolving Hyper Heuristic-Based Solvers for Rush Hour and FreeCell.
Ami Hauptman, Achiya Elyasaf, Moshe Sipper
2010Finding Acceptable Solutions Faster Using Inadmissible Information.
Jordan Tyler Thayer, Wheeler Ruml
2010GPU Exploration of Two-Player Games with Perfect Hash Functions.
Stefan Edelkamp, Damian Sulewski, Cengizhan Yücel
2010Heuristic Contraction Hierarchies with Approximation Guarantee.
Robert Geisberger, Dennis Schieferdecker
2010High-Quality Policies for the Canadian Traveler's Problem.
Patrick Eyerich, Thomas Keller, Malte Helmert
2010Improving Local Search for Resource-Constrained Planning.
Hootan Nakhost, Jörg Hoffmann, Martin Müller
2010Landmark Heuristics for the Pancake Problem.
Malte Helmert
2010Layer-Abstraction for Symbolically Solving General Two-Player Games.
Peter Kissmann, Stefan Edelkamp
2010Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D.
Alex Nash, Sven Koenig, Craig A. Tovey
2010Objective Functions for Multi-Way Number Partitioning.
Richard E. Korf
2010On Transposition Tables for Single-Agent Search and Planning: Summary of Results.
Yuima Akagi, Akihiro Kishimoto, Alex Fukunaga
2010On the Scaling Behavior of HDA.
Akihiro Kishimoto, Alex Fukunaga, Adi Botea
2010Portal-Based True-Distance Heuristics for Path Finding.
Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer
2010Potential Search: A New Greedy Anytime Heuristic Search.
Roni Tzvi Stern, Rami Puzis, Ariel Felner
2010Preface.
2010Proceedings of the Third Annual Symposium on Combinatorial Search, SOCS 2010, Stone Mountain, Atlanta, Georgia, USA, July 8-10, 2010
Ariel Felner, Nathan R. Sturtevant
2010Real-Time Search in Dynamic Worlds.
David Bond, Niels A. Widger, Wheeler Ruml, Xiaoxun Sun
2010Search Space Reduction Using Swamp Hierarchies.
Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein, Ariel Felner
2010Search-Based Path Planning with Homotopy Class Constraints.
Subhrajit Bhattacharya, Vijay Kumar, Maxim Likhachev
2010Searching for a k-Clique in Unknown Graphs.
Roni Tzvi Stern, Meir Kalech, Ariel Felner
2010Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms.
Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto
2010Single-Frontier Bidirectional Search.
Carsten Moldenhauer, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer
2010SoCS 2010 Organization.
2010The Logic of Benchmarking: A Case Against State-of-the-Art Performance.
Wheeler Ruml