Abstract is missing.
- Invited SpeakersJ. Christopher Beck, Gene Cooperman. [doi]
- SoCS 2013 OrganizationMalte Helmert, Gabriele Röger. [doi]
- PrefaceMalte Helmert, Gabriele Röger. [doi]
- Anytime Truncated D* : Anytime Replanning with TruncationSandip Aine, Maxim Likhachev. 2-10 [doi]
- An Analysis Framework for Examination TimetablingTaha Arbaoui, Jean Paul Boufflet, Aziz Moukrim. 11-19 [doi]
- Parallelising the k-Medoids Clustering Problem Using Space-PartitioningAlejandro Arbelaez, Luis Quesada. 20-28 [doi]
- Fast Detection of Unsolvable Planning Instances Using Local ConsistencyChrister Bäckström, Peter Jonsson, Simon Ståhlberg. 29-37 [doi]
- Multi-Agent Path Finding for Self Interested AgentsZahy Bnaya, Roni Stern, Ariel Felner, Roie Zivan, Steven Okamoto. 38-46 [doi]
- Experimental Real-Time Heuristic Search Results in a Video GameEthan Burns, Scott Kiesel, Wheeler Ruml. 47-54 [doi]
- Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates Is ModerateJohn Paul Dickerson, Tuomas Sandholm. 55-62 [doi]
- To UCT, or not to UCT? (Position Paper)Carmel Domshlak, Zohar Feldman. 63-70 [doi]
- Multi-Hop Ride SharingFlorian Drews, Dennis Luxen. 71-79 [doi]
- Bidirectional Preference-Based Search for State Space Graph ProblemsLucie Galand, Anisse Ismaili, Patrice Perny, Olivier Spanjaard. 80-88 [doi]
- Optimal-Generation Variants of EPEAMeir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer. 89-97 [doi]
- Bounded Suboptimal Heuristic Search in Linear SpaceMatthew Hatem, Roni Stern, Wheeler Ruml. 98-104 [doi]
- Red-Black Relaxed Plan Heuristics ReloadedMichael Katz, Jörg Hoffmann. 105-113 [doi]
- From Feasibility Tests to Path Planners for Multi-Agent PathfindingAthanasios Krontiris, Ryan Luna, Kostas E. Bekris. 114-122 [doi]
- Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued HeuristicsLevi H. S. Lelis. 123-132 [doi]
- Evolving Instance Specific Algorithm ConfigurationYuri Malitsky, Deepak Mehta, Barry O'Sullivan. 133-140 [doi]
- Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern DatabasesAndré Grahl Pereira, Marcus Ritt, Luciana Salete Buriol. 141-148 [doi]
- GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple PolynomialsNaina Razakarison, Mats Carlsson, Nicolas Beldiceanu, Helmut Simonis. 149-157 [doi]
- Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time SearchNicolas Rivera, Leon Illanes, Jorge A. Baier, Carlos Hernández. 158-166 [doi]
- Online Detection of Dead States in Real-Time Agent-Centered SearchGuni Sharon, Nathan R. Sturtevant, Ariel Felner. 167-174 [doi]
- Constrained Symbolic Search: On Mutexes, BDD Minimization and MoreÁlvaro Torralba, Vidal Alcázar. 175-183 [doi]
- Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized PlannersMauro Vallati, Chris Fawcett, Alfonso Gerevini, Holger H. Hoos, Alessandro Saetti. 184-192 [doi]
- Planning Paths with Fewer Turns on Grid MapsHu Xu, Lei Shu, May Huang. 193-200 [doi]
- Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract)Faten Aljalaud, Nathan R. Sturtevant. 203-204 [doi]
- Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract)Hannah Bast, Sabine Storandt. 205-206 [doi]
- Multi-Agent Planning with Mixed-Integer Programming and Adaptive Interaction Constraint Generation (Extended Abstract)Jan-P. Calliess, Stephen J. Roberts. 207-208 [doi]
- The Hierarchy in Grid Graphs (Extended Abstract)Sabine Storandt. 210-211 [doi]
- Customizable Route Planning in Road Networks (Extended Abstract)Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck. 212 [doi]
- Round-Based Public Transit Routing (Extended Abstract)Daniel Delling, Thomas Pajor, Renato F. Werneck. 213 [doi]
- Polynomial-Time Construction of Contraction Hierarchies for Multi-Criteria ObjectivesStefan Funke, Sabine Storandt. 214-215 [doi]
- Target-Value Search Revisited (Extended Abstract)Carlos Linares López, Roni Stern, Ariel Felner. 216-217 [doi]
- Candidate Sets for Alternative Routes in Road Networks (Extended Abstract)Dennis Luxen, Dennis Schieferdecker. 218-219 [doi]
- Towards Rational Deployment of Multiple Heuristics in A* (Extended Abstract)David Tolpin, Tal Beja, Solomon Eyal Shimony, Ariel Felner, Erez Karpas. 220-221 [doi]