SoCS 2010: The Third Annual Symposium on Combinatorial Search
SoCS 2010 Accepted Papers
Papers accepted for oral presentation | |
On the Scaling Behavior of HDA* | |
Akihiro Kishimoto, Alex Fukunaga and Adi Botea. | |
On Transposition Tables for Single-Agent Search and Planning: Summary of Results | |
Yuima Akagi, Akihiro Kishimoto and Alex Fukunaga. | |
Adding Diversity to Classical Heuristic Planning | |
Carlos Linares Lopez and Daniel Borrajo. | |
Layer-Abstraction for Symbolically Solving General Two-Player Games | |
Peter Kissmann and Stefan Edelkamp. | |
GPU Exploration of Two-Player Games with Perfect Hash Functions | |
Stefan Edelkamp and Damian Sulewski. | |
Parallel, Dynamic K-Best-First Search | |
Vincent Vidal, Lucas Bordeaux and Youssef Hamadi. | |
Additive Heuristic for Four-Connected Gridworlds | |
Kenneth Anderson. | |
Improving Local Search for Resource-Constrained Planning | |
Hootan Nakhost, Jorg Hoffmann and Martin Mueller. | |
Bootstrap Learning of Heuristic Functions | |
Shahab Jabbari, Sandra Zilles and Robert C. Holte. | |
Searching for a k-Clique in Unknown Graphs | |
Roni Stern, Meir Kalech and Ariel Felner. | |
Directed Plateau Search for MAX-k-SAT | |
Andrew M. Sutton, Adele E. Howe and L. Darrell Whitley. | |
Finding Acceptable Solutions Faster Using Inadmissible Information | |
Jordan Thayer and Wheeler Ruml. | |
Portal-Based True-Distance Heuristics for Path Finding | |
Meir Goldenberg, Ariel Felner, Nathan Sturtevant and Jonathan Schaeffer. | |
Improved Multi-Way Number Partitioning | |
Richard Korf. | |
Heuristic Contraction Hierarchies with Approximation Guarantee | |
Robert Geisberger and Dennis Schieferdecker. | |
Real-Time Search in Dynamic Worlds | |
David M. Bond, Niels A. Widger, Wheeler Ruml, Xiaoxun Sun and Sven Koenig. | |
Papers accepted for poster presentation | |
Potential search: a greedy anytime heuristic search | |
Roni Stern, Rami Puzis and Ariel Felner. | |
Anytime Heuristic Search: Frameworks and Algorithms | |
Jordan Thayer and Wheeler Ruml. | |
Computing Equivalent Transformations for Applying Branch-and-Bound Search to MaxSAT | |
Eric Hsu and Sheila McIlraith. | |
A Comparison of Greedy Search Algorithms | |
Christopher Wilt, Jordan Thayer and Wheeler Ruml. | |
Landmark Heuristics for the Pancake Problem | |
Malte Helmert. | |
Edge Partitioning in Parallel Structured Duplicate Detection | |
Rong Zhou, Tim Schmidt, Eric Hansen, Minh Do and Serdar Uckun. | |
Position papers | |
Cost-based Search Considered Harmful | |
William Cushing, J. Benton and Subbarao Kambhampati | |
On the Selection of Benchmark Sizes | |
Wheeler Ruml | |
Posters from other conferences | |
Search Space Reduction Using Swamp Hierarchies | |
Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein and Ariel Felner. | |
Single-Frontier Bidirectional Search | |
Carsten Moldenhauer, Ariel Felner, Nathan Sturtevant and Jonathan Schaeffer. | |
Any-Angle Path Planning and Path Length Analysis in 3D | |
Alex Nash, Sven Koenig and Craig Tovey. | |
High-Quality Policies for the Canadian Traveler's Problem | |
Patrick Eyerich, Thomas Keller and Malte Helmert. | |
Search-based Planning for Manipulation with Motion Primitives | |
Benjamin Cohen, Sachin Chitta and Maxim Likhachev. | |
Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms | |
Richard Valenzano, Nathan Sturtevant, Jonathan Schaeffer, Karen Buro and Akihiro Kishimoto. | |
Search-based Path Planning with Homotopy Class Constraints | |
Subhrajit Bhattacharya, Vijay Kumar and Maxim Likhachev. | |
GP-Rush: Using Genetic Programming to Evolve Solvers for the Rush Hour Puzzle | |
Ami Hauptman, Achiya Elyasaf, Moshe Sipper and Assaf Karmon. |