---

---

---

---

SoCS 2014: The Seventh Annual Symposium on Combinatorial Search

SoCS 2014 Proceedings

The proceedings (individual papers) are available for free from the AAAI digital library. Complete electronic and softcover versions can be purchased from AAAI.

Accepted Papers

Original Full Papers

• Handling All Unit Propagation Reasons in Branch and Bound Max-SAT Solvers
  André Abramé and Djamal Habet
• On Different Strategies for Eliminating Redundant Actions from Plans
  Tomáš Balyo, Lukas Chrpa and Asma Kilani
• Suboptimal Variants of Multi-Agent Pathfinding Algorithms
  Max Barer, Guni Sharon, Roni Stern and Ariel Felner
• On the attainability of NK landscapes global optima
  Matthieu Basseur, Adrien Goeffon, Frédéric Lardeux, Frédéric Saubion and Vincent Vigneron
• Hybrid Planning Heuristics Based on Task Decomposition Graphs
  Pascal Bercher, Shawn Keen and Susanne Biundo
• A* with Lookahead Re-evaluated
  Zhaoxing Bu, Roni Stern, Ariel Felner and Robert Holte
• Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions
  Gaojian Fan, Martin Mueller and Robert Holte
• ReACT: Real-time Algorithm Configuration through Tournaments
  Tadhg Fitzgerald, Yuri Malitsky, Barry O'Sullivan and Kevin Tierney
• Evaluating Weighted DFS Branch and Bound over Graphical Models
  Natalia Flerova, Radu Marinescu and Rina Dechter
• Anytime Tree-Restoring Weighted A* Graph Search
  Kalin Gochev, Alla Safonova and Maxim Likhachev
• Bounded Suboptimal Search in Linear Space: New Results
  Matthew Hatem and Wheeler Ruml
• Beyond Static Mini-Bucket: Initial Results on Comparing and Integrating with Iterative Cost-Shifting Based Heuristics
  William Lam, Kalev Kask, Rina Dechter and Alexander Ihler
• Estimating the Size of Heuristic Search Expanded Graphs
  Levi Lelis, Roni Stern and Nathan Sturtevant
• Latent Features for Algorithm Selection
  Yuri Malitsky and Barry O'Sullivan
• Extended Framework for Target Oriented Network Intelligence Collection
  Liron Samama, Rami Puzis, Roni Stern and Ariel Felner
• Balancing Exploration and Exploitation in Classical Planning
  Tim Schulte and Thomas Keller
• Max is More than Min: Solving Maximization Problems with Heuristic Search
  Roni Stern, Scott Kiesel, Rami Puzis, Ariel Felner and Wheeler Ruml
• Fast First-Move Queries through Run Length Encoding
  Ben Strasser, Daniel Harabor and Adi Botea
• Reaching the Goal in Real-Time Heuristic Search: Scrubbing Behavior is Unavoidable Nathan Sturtevant and Vadim Bulitko
• Exploiting the Rubik's Cube 12-edge PDB by Combining Partial Pattern Databases and Bloom Filters
  Nathan Sturtevant, Ariel Felner and Malte Helmert
• Time-Bounded Best-First Search
  Carlos Hernández Ulloa, Roberto Javier Asín Achá and Jorge Baier
• Speedy versus Greedy Search
  Christopher Wilt and Wheeler Ruml

Original Research Abstracts

• The Application of Pareto Local Search to the Single-objective Quadratic Assignment Problem
  Abdullah Alsheddy
• Improved Heuristic Search for Computing Sparse Data Structures for Motion Planning
  Andrew Dobson and Kostas Bekris
• How Do You Know that Your Search Algorithm and Code are Correct?
  Richard Korf
• Solving the Target-Value Search Problem
  Carlos Linares López, Roni Stern and Ariel Felner
• STLS: Cutset-Driven Local Search For MPE
  Alon Milchgrub and Rina Dechter
• Toward a Search Strategy for Anytime Search in Linear Space using Depth-First Branch and Bound
  Carlos Hernández Ulloa and Jorge Baier

Previously Published Work Presented at SoCS 2014

• Multi-Heuristic A* (published at RSS 2014)
  Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang and Maxim Likhachev
• Symbolic and Explicit Search Hybrid through Perfect Hash Functions - A Case Study in Connect Four (published at ICAPS 2014)
  Stefan Edelkamp, Peter Kissmann and Martha Rohte
• Solving Single Vehicle Pickup and Delivery Problems with Time Windows and Capacity Constraints using Nested Monte-Carlo Search (published at ICAART 2014)
  Stefan Edelkamp and Max Gath
• Exponential Deepening A* for Real-Time Agent-Centered Search (published at AAAI 2014)
  Guni Sharon, Ariel Felner and Nathan Sturtevant
• Identifying Hierarchies for Fast Optimal Search (published at AAAI 2014)
  Tansel Uras and Sven Koenig
• Past, Present, and Future: An Optimal Online Algorithm for Single-Player GDL-II Games (published at ECAI 2014)
  Florian Geißer, Thomas Keller, and Robert Mattmüller