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