3. SOCS 2010: Atlanta, Georgia, USA

Frontmatter

• SoCS 2010 Organization.
  
• Preface.
  

Oral Presentations

• Yuima Akagi, Akihiro Kishimoto, Alex Fukunaga:
  On Transposition Tables for Single-Agent Search and Planning: Summary of Results.
  
• Kenneth Anderson:
  Additive Heuristic for Four-Connected Gridworlds.
  
• David Bond, Niels A. Widger, Wheeler Ruml, Xiaoxun Sun:
  Real-Time Search in Dynamic Worlds.
  
• Stefan Edelkamp, Damian Sulewski, Cengizhan Yücel:
  GPU Exploration of Two-Player Games with Perfect Hash Functions.
  
• Robert Geisberger, Dennis Schieferdecker:
  Heuristic Contraction Hierarchies with Approximation Guarantee.
  
• Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer:
  Portal-Based True-Distance Heuristics for Path Finding.
  
• Robert C. Holte:
  Common Misconceptions Concerning Heuristic Search.
  
• Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
  Bootstrap Learning of Heuristic Functions.
  
• Akihiro Kishimoto, Alex Fukunaga, Adi Botea:
  On the Scaling Behavior of HDA.
  
• Peter Kissmann, Stefan Edelkamp:
  Layer-Abstraction for Symbolically Solving General Two-Player Games.
  
• Richard E. Korf:
  Objective Functions for Multi-Way Number Partitioning.
  
• Carlos Linares López, Daniel Borrajo:
  Adding Diversity to Classical Heuristic Planning.
  
• Hootan Nakhost, Jörg Hoffmann, Martin Müller:
  Improving Local Search for Resource-Constrained Planning.
  
• Roni Tzvi Stern, Meir Kalech, Ariel Felner:
  Searching for a k-Clique in Unknown Graphs.
  
• Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
  Directed Plateau Search for MAX-k-SAT.
  
• Jordan Tyler Thayer, Wheeler Ruml:
  Finding Acceptable Solutions Faster Using Inadmissible Information.
  
• Vincent Vidal, Lucas Bordeaux, Youssef Hamadi:
  Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning.
  

Posters

• Malte Helmert:
  Landmark Heuristics for the Pancake Problem.
  
• Eric I. Hsu, Sheila A. McIlraith:
  Computing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound Search.
  
• Roni Tzvi Stern, Rami Puzis, Ariel Felner:
  Potential Search: A New Greedy Anytime Heuristic Search.
  
• Jordan Tyler Thayer, Wheeler Ruml:
  Anytime Heuristic Search: Frameworks and Algorithms.
  
• Christopher Makoto Wilt, Jordan Tyler Thayer, Wheeler Ruml:
  A Comparison of Greedy Search Algorithms.
  
• Rong Zhou, Tim Schmidt, Eric A. Hansen, Minh Binh Do, Serdar Uckun:
  Edge Partitioning in Parallel Structured Duplicate Detection.
  

Position Papers

• William Cushing, J. Benton, Subbarao Kambhampati:
  Cost Based Search Considered Harmful.
  
• Wheeler Ruml:
  The Logic of Benchmarking: A Case Against State-of-the-Art Performance.
  

Abstracts

• Subhrajit Bhattacharya, Vijay Kumar, Maxim Likhachev:
  Search-Based Path Planning with Homotopy Class Constraints.
  
• Patrick Eyerich, Thomas Keller, Malte Helmert:
  High-Quality Policies for the Canadian Traveler's Problem.
  
• Ami Hauptman, Achiya Elyasaf, Moshe Sipper:
  Evolving Hyper Heuristic-Based Solvers for Rush Hour and FreeCell.
  
• Carsten Moldenhauer, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer:
  Single-Frontier Bidirectional Search.
  
• Alex Nash, Sven Koenig, Craig A. Tovey:
  Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D.
  
• Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein, Ariel Felner:
  Search Space Reduction Using Swamp Hierarchies.
  
• Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto:
  Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms.
  

Last update Fri May 25 08:40:38 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page