default search action
6. SOCS 2013: Leavenworth, Washington, USA
- Malte Helmert, Gabriele Röger:
Proceedings of the Sixth Annual Symposium on Combinatorial Search, SOCS 2013, Leavenworth, Washington, USA, July 11-13, 2013. AAAI Press 2013, ISBN 978-1-57735-584-7 - Malte Helmert, Gabriele Röger:
SoCS 2013 Organization. - J. Christopher Beck, Gene Cooperman:
Invited Speakers. - Malte Helmert, Gabriele Röger:
Preface.
Full Papers
- Sandip Aine, Maxim Likhachev:
Anytime Truncated D* : Anytime Replanning with Truncation. 2-10 - Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim:
An Analysis Framework for Examination Timetabling. 11-19 - Alejandro Arbelaez, Luis Quesada:
Parallelising the k-Medoids Clustering Problem Using Space-Partitioning. 20-28 - Christer Bäckström, Peter Jonsson, Simon Ståhlberg:
Fast Detection of Unsolvable Planning Instances Using Local Consistency. 29-37 - Zahy Bnaya, Roni Stern, Ariel Felner, Roie Zivan, Steven Okamoto:
Multi-Agent Path Finding for Self Interested Agents. 38-46 - Ethan Burns, Scott Kiesel, Wheeler Ruml:
Experimental Real-Time Heuristic Search Results in a Video Game. 47-54 - John Paul Dickerson, Tuomas Sandholm:
Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates Is Moderate. 55-62 - Carmel Domshlak, Zohar Feldman:
To UCT, or not to UCT? (Position Paper). 63-70 - Florian Drews, Dennis Luxen:
Multi-Hop Ride Sharing. 71-79 - Lucie Galand, Anisse Ismaili, Patrice Perny, Olivier Spanjaard:
Bidirectional Preference-Based Search for State Space Graph Problems. 80-88 - Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer:
Optimal-Generation Variants of EPEA. 89-97 - Matthew Hatem, Roni Stern, Wheeler Ruml:
Bounded Suboptimal Heuristic Search in Linear Space. 98-104 - Michael Katz, Jörg Hoffmann:
Red-Black Relaxed Plan Heuristics Reloaded. 105-113 - Athanasios Krontiris, Ryan Luna, Kostas E. Bekris:
From Feasibility Tests to Path Planners for Multi-Agent Pathfinding. 114-122 - Levi H. S. Lelis:
Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics. 123-132 - Yuri Malitsky, Deepak Mehta, Barry O'Sullivan:
Evolving Instance Specific Algorithm Configuration. 133-140 - André Grahl Pereira, Marcus Ritt, Luciana Salete Buriol:
Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases. 141-148 - Naina Razakarison, Mats Carlsson, Nicolas Beldiceanu, Helmut Simonis:
GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials. 149-157 - Nicolas Rivera, Leon Illanes, Jorge A. Baier, Carlos Hernández:
Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search. 158-166 - Guni Sharon, Nathan R. Sturtevant, Ariel Felner:
Online Detection of Dead States in Real-Time Agent-Centered Search. 167-174 - Álvaro Torralba
, Vidal Alcázar:
Constrained Symbolic Search: On Mutexes, BDD Minimization and More. 175-183 - Mauro Vallati, Chris Fawcett, Alfonso Gerevini, Holger H. Hoos, Alessandro Saetti:
Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners. 184-192 - Hu Xu, Lei Shu, May Huang:
Planning Paths with Fewer Turns on Grid Maps. 193-200
Research Abstracts
- Faten Aljalaud, Nathan R. Sturtevant:
Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract). 203-204 - Hannah Bast, Sabine Storandt:
Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract). 205-206 - Jan-P. Calliess, Stephen J. Roberts:
Multi-Agent Planning with Mixed-Integer Programming and Adaptive Interaction Constraint Generation (Extended Abstract). 207-208 - Sabine Storandt:
The Hierarchy in Grid Graphs (Extended Abstract). 210-211
Extended Abstracts
- Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks (Extended Abstract). 212 - Daniel Delling, Thomas Pajor, Renato F. Werneck:
Round-Based Public Transit Routing (Extended Abstract). 213 - Stefan Funke, Sabine Storandt:
Polynomial-Time Construction of Contraction Hierarchies for Multi-Criteria Objectives. 214-215 - Carlos Linares López, Roni Stern, Ariel Felner:
Target-Value Search Revisited (Extended Abstract). 216-217 - Dennis Luxen, Dennis Schieferdecker:
Candidate Sets for Alternative Routes in Road Networks (Extended Abstract). 218-219 - David Tolpin, Tal Beja, Solomon Eyal Shimony, Ariel Felner, Erez Karpas:
Towards Rational Deployment of Multiple Heuristics in A* (Extended Abstract). 220-221
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-12-26 00:34 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: