SoCS 2013


Important Links
Paper Submission (EasyChair)
Proceedings (AAAI Press)

Related Conferences

Past SoCS Conferences
2012 Niagara Falls, Canada
2011 Barcelona, Spain
2010 Atlanta, GA
2009 Lake Arrowhead, CA
2008 Chicago, IL

SoCS 2013: The Sixth Annual Symposium on Combinatorial Search


July 11

18:30-20:30 Dinner

July 12

08:45-09:00 Opening Remarks
09:00-09:50 Invited Talk: Chris Beck (joint invited talk with SARA)
09:50-10:50 Session I: Constraint Programming and SAT (joint session with SARA) (session chair: Toby Walsh)
  • Taha Arbaoui, Jean-Paul Boufflet and Aziz Moukrim.
    An Analysis Framework for Examination Timetabling
  • Naina Razakarison, Nicolas Beldiceanu, Mats Carlsson and Helmut Simonis.
    GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials
  • John P. Dickerson and Tuomas Sandholm.
    Throwing darts: Random sampling helps tree search when the number of short certificates is moderate
10:50-11:20 Coffee Break
11:20-12:40 Session II: Search Algorithms (session chair: Richard Korf)
  • Lucie Galand, Anisse Ismaili, Patrice Perny and Olivier Spanjaard.
    Bidirectional Preference-based Search for Multiobjective State Space Graph Problems
  • Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Robert C. Holte and Jonathan Schaeffer.
    Optimal-Generation Variants of EPEA*
  • Sandip Aine and Maxim Likhachev.
    Anytime Truncated D*: Anytime Replanning with Truncation
  • Matthew Hatem, Roni Stern and Wheeler Ruml.
    Bounded Suboptimal Heuristic Search in Linear Space
12:40-14:00 Lunch Break
14:00-15:20 Session III: Planning and UCT (session chair: Malte Helmert)
  • Peter Jonsson, Christer Bäckström and Simon Ståhlberg.
    Fast Detection of Unsolvable Planning Instances Using Local Consistency
  • Álvaro Torralba and Vidal Alcázar.
    Constrained Symbolic Search: On Mutexes, BDD Minimization and More
  • Michael Katz and Jörg Hoffmann.
    Red-Black Relaxed Plan Heuristics Reloaded
  • Carmel Domshlak and Zohar Feldman.
    To UCT, or not to UCT? (Position Paper)
15:20-15:50 Coffee Break
15:50-16:40 Session IV: Poster Spotlights and Path-planning Competition Results (session chair: Carlos Linares López)
16:40-18:30 Poster Session
18:30-20:30 Dinner
20:30-21:30 Awards and Discussion

July 13

09:00-09:50 Invited Talk: Gene Cooperman
09:50-10:50 Session V: Algorithm Selection and Performance Prediction (session chair: Jörg Hoffmann)
  • Mauro Vallati, Chris Fawcett, Alfonso Emilio Gerevini, Holger H. Hoos and Alessandro Saetti.
    Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners
  • Yuri Malitsky, Deepak Mehta and Barry O'Sullivan.
    Evolving Instance Specific Algorithm Configuration
  • Levi Lelis.
    Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics
10:50-11:20 Coffee Break
11:20-12:20 Session VI: Real-time Search (session chair: Sven Koenig)
  • Ethan Burns, Scott Kiesel and Wheeler Ruml.
    Experimental Real-time Heuristic Search Results in a Video Game
  • Guni Sharon, Nathan Sturtevant and Ariel Felner.
    Online Detection of Dead States in Real-Time Agent-Centered Search
  • Nicolás Rivera, León Illanes, Jorge Baier and Carlos Hernández Ulloa.
    Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search
12:20-13:40 Lunch Break
13:40-15:00 Session VII: Pathfinding and Ride Sharing (session chair: Nathan Sturtevant)
  • Zahy Bnaya, Roni Stern, Ariel Felner, Roie Zivan and Steven Okamoto.
    Multi-Agent Path Finding for Self Interested Agents
  • Athanasios Krontiris, Ryan Luna and Kostas Bekris.
    From Feasibility Tests to Path Planners for Multi-Agent Pathfinding
  • Hu Xu, Lei Shu and May Huang.
    Planning Paths with Fewer Turns on Grid Maps
  • Florian Drews and Dennis Luxen.
    Multi-Hop Ride Sharing
15:00-15:30 Coffee Break
15:30-16:10 Session VIII: Final Session (session chair: Gabriele Röger)
  • Alejandro Arbelaez and Luis Quesada.
    Parallelising the k-Medoids Clustering Problem Using Space-Partitioning
  • André Grahl Pereira, Marcus Rolf Peter Ritt and Luciana Salete Buriol.
    Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases
16:10-16:20 Closing Remarks