Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. SOCS 2010: Atlanta, Georgia, USA
- Ariel Felner, Nathan R. Sturtevant:
Proceedings of the Third Annual Symposium on Combinatorial Search, SOCS 2010, Stone Mountain, Atlanta, Georgia, USA, July 8-10, 2010. AAAI Press 2010
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. 2-9 - Kenneth Anderson:
Additive Heuristic for Four-Connected Gridworlds. 10-15 - David Bond, Niels A. Widger, Wheeler Ruml, Xiaoxun Sun:
Real-Time Search in Dynamic Worlds. 16-22 - Stefan Edelkamp, Damian Sulewski, Cengizhan Yücel:
GPU Exploration of Two-Player Games with Perfect Hash Functions. 23-30 - Robert Geisberger, Dennis Schieferdecker:
Heuristic Contraction Hierarchies with Approximation Guarantee. 31-38 - Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer:
Portal-Based True-Distance Heuristics for Path Finding. 39-45 - Robert C. Holte:
Common Misconceptions Concerning Heuristic Search. 46-51 - Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Bootstrap Learning of Heuristic Functions. 52-60 - Akihiro Kishimoto, Alex Fukunaga, Adi Botea:
On the Scaling Behavior of HDA. 61-62 - Peter Kissmann, Stefan Edelkamp:
Layer-Abstraction for Symbolically Solving General Two-Player Games. 63-70 - Richard E. Korf:
Objective Functions for Multi-Way Number Partitioning. 71-72 - Carlos Linares López, Daniel Borrajo:
Adding Diversity to Classical Heuristic Planning. 73-80 - Hootan Nakhost, Jörg Hoffmann, Martin Müller:
Improving Local Search for Resource-Constrained Planning. 81-82 - Roni Tzvi Stern, Meir Kalech, Ariel Felner:
Searching for a k-Clique in Unknown Graphs. 83-89 - Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Directed Plateau Search for MAX-k-SAT. 90-97 - Jordan Tyler Thayer, Wheeler Ruml:
Finding Acceptable Solutions Faster Using Inadmissible Information. 98-99 - Vincent Vidal, Lucas Bordeaux, Youssef Hamadi:
Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning. 100-107
Posters
- Malte Helmert:
Landmark Heuristics for the Pancake Problem. 109-110 - Eric I. Hsu, Sheila A. McIlraith:
Computing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound Search. 111-112 - Roni Tzvi Stern, Rami Puzis, Ariel Felner:
Potential Search: A New Greedy Anytime Heuristic Search. 119-120 - Jordan Tyler Thayer, Wheeler Ruml:
Anytime Heuristic Search: Frameworks and Algorithms. 121-128 - Christopher Makoto Wilt, Jordan Tyler Thayer, Wheeler Ruml:
A Comparison of Greedy Search Algorithms. 129-136 - Rong Zhou, Tim Schmidt, Eric A. Hansen, Minh Binh Do, Serdar Uckun:
Edge Partitioning in Parallel Structured Duplicate Detection. 137-138
Position Papers
- William Cushing, J. Benton, Subbarao Kambhampati:
Cost Based Search Considered Harmful. 140-141 - Wheeler Ruml:
The Logic of Benchmarking: A Case Against State-of-the-Art Performance. 142-143
Abstracts
- Subhrajit Bhattacharya, Vijay Kumar, Maxim Likhachev:
Search-Based Path Planning with Homotopy Class Constraints. 145-146 - Patrick Eyerich, Thomas Keller, Malte Helmert:
High-Quality Policies for the Canadian Traveler's Problem. 147-148 - Ami Hauptman, Achiya Elyasaf, Moshe Sipper:
Evolving Hyper Heuristic-Based Solvers for Rush Hour and FreeCell. 149-150 - Carsten Moldenhauer, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer:
Single-Frontier Bidirectional Search. 151-152 - Alex Nash, Sven Koenig, Craig A. Tovey:
Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D. 153-154 - Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein, Ariel Felner:
Search Space Reduction Using Swamp Hierarchies. 155-156 - 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. 157-158
a service of 
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-04-22 20:00 CEST 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:
