default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. SOCS 2011: Castell de Cardona, Barcelona, Spain
- Daniel Borrajo, Maxim Likhachev, Carlos Linares López:
Proceedings of the Fourth Annual Symposium on Combinatorial Search, SOCS 2011, Castell de Cardona, Barcelona, Spain, July 15.16, 2011. AAAI Press 2011
Full Papers
- Vidal Alcázar, Manuela M. Veloso, Daniel Borrajo:
Adapting a Rapidly-Exploring Random Tree for Automated Planning. 2-9 - Christer Bäckström, Peter Jonsson:
All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. 10-17 - Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer:
Degrees of Separation in Social Networks. 18-23 - Zahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon Eyal Shimony:
Repeated-Task Canadian Traveler Problem. 24-30 - Neil Burch, Robert C. Holte:
Automatic Move Pruning in General Single-Player Games. 31-38 - Austin J. Dionne, Jordan Tyler Thayer, Wheeler Ruml:
Deadline-Aware Search Using On-Line Measures of Behavior. 39-46 - Ariel Felner:
Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm. 47-51 - Kalin Gochev, Benjamin J. Cohen, Jonathan Butzke, Alla Safonova, Maxim Likhachev:
Path Planning with Adaptive Dimensionality. 52-59 - Juan Pablo Gonzalez, Maxim Likhachev:
Search-Based Planning with Provable Suboptimality Bounds for Continuous State Spaces. 60-67 - Morteza Keshtkaran
, Roohollah Taghizadeh, Koorush Ziarati:
A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems. 68-75 - Mokhtar M. Khorshid, Robert C. Holte, Nathan R. Sturtevant:
A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding. 76-83 - Lars Kotthoff, Ian P. Gent, Ian Miguel:
A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems. 84-91 - Michael J. Leighton, Wheeler Ruml, Robert C. Holte:
Faster Optimal and Suboptimal Hierarchical Search. 92-99 - Levi Lelis, Roni Stern, Shahab Jabbari Arfaee:
Predicting Solution Cost with Conditional Probabilities. 100-107 - Levi Lelis, Sandra Zilles, Robert C. Holte:
Improved Prediction of IDA*'s Performance via Epsilon-Truncation. 108-116 - Lars Otten, Rina Dechter:
Anytime AND/OR Depth-First Search for Combinatorial Optimization. 117-124 - Bo Pang, Robert C. Holte:
State-Set Search. 125-133 - Kevin Rose, Ethan Burns, Wheeler Ruml:
Best-First Search for Bounded-Depth Trees. 134-141 - Tim Schmidt, Rong Zhou:
Representing Pattern Databases with Succinct Data Structures. 142-149 - Guni Sharon, Roni Tzvi Stern, Meir Goldenberg, Ariel Felner:
Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding. 150-157 - Roni Stern, Ariel Felner, Robert Holte:
Probably Approximately Correct Heuristic Search. 158-163 - Álvaro Torralba Arias de Reyna, Carlos Linares López:
Size-Independent Additive Pattern Databases for the Pancake Problem. 164-171 - Christopher Makoto Wilt, Wheeler Ruml:
Cost-Based Heuristic Search Is Sensitive to the Ratio of Operator Costs. 172-179 - Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa:
Scalable Distributed Monte-Carlo Tree Search. 180-187
Abstracts
- Achiya Elyasaf, Yael Zaritsky, Ami Hauptman, Moshe Sipper:
Evolving Solvers for FreeCell and the Sliding-Tile Puzzle. 189-190 - Meir Goldenberg, Nathan R. Sturtevant, Ariel Felner, Jonathan Schaeffer:
The Compressed Differential Heuristic. 191-192 - Carlos Hernández, Jorge A. Baier:
Real-Time Adaptive A* with Depression Avoidance. 193-194 - Eric Huang, Richard E. Korf:
Optimal Packing of High-Precision Rectangles. 195-196 - Tatsuya Imai, Akihiro Kishimoto:
A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning. 197-198 - Aleksandr Kushleyev, Brian MacAllister, Maxim Likhachev:
Planning for Landing Site Selection in the Aerial Supply Delivery. 199-200 - Ryan Luna, Kostas E. Bekris:
Efficient and Complete Centralized Multi-Robot Path Planning. 201-202 - Mike Phillips, Maxim Likhachev:
Planning in Domains with Cost Function Dependent Actions. 203-204 - Mihail Pivtoraiko, Alonzo Kelly:
Graduated Fidelity Motion Planning. 205-206 - Nathan R. Sturtevant:
Distance Learning in Agent-Centered Heuristic Search. 207-208 - Ko-Hsin Cindy Wang, Adi Botea, Philip Kilby:
On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding. 209-210 - Peter Kai Yue Yap, Neil Burch, Robert C. Holte, Jonathan Schaeffer:
Abstract: Block A* and Any-Angle Path-Planning. 211-212
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 2025-12-01 23:20 CET 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:
