• Skip to main content
  • Skip to primary sidebar
AAAI

AAAI

Association for the Advancement of Artificial Intelligence

    • AAAI

      AAAI

      Association for the Advancement of Artificial Intelligence

  • About AAAIAbout AAAI
    • AAAI Officers and Committees
    • AAAI Staff
    • Bylaws of AAAI
    • AAAI Awards
      • Fellows Program
      • Classic Paper Award
      • Dissertation Award
      • Distinguished Service Award
      • Allen Newell Award
      • Outstanding Paper Award
      • Award for Artificial Intelligence for the Benefit of Humanity
      • Feigenbaum Prize
      • Patrick Henry Winston Outstanding Educator Award
      • Engelmore Award
      • AAAI ISEF Awards
      • Senior Member Status
      • Conference Awards
    • AAAI Resources
    • AAAI Mailing Lists
    • Past AAAI Presidential Addresses
    • Presidential Panel on Long-Term AI Futures
    • Past AAAI Policy Reports
      • A Report to ARPA on Twenty-First Century Intelligent Systems
      • The Role of Intelligent Systems in the National Information Infrastructure
    • AAAI Logos
    • News
  • aaai-icon_ethics-diversity-line-yellowEthics & Diversity
  • Conference talk bubbleConferences & Symposia
    • AAAI Conference
    • AIES AAAI/ACM
    • AIIDE
    • IAAI
    • ICWSM
    • HCOMP
    • Spring Symposia
    • Summer Symposia
    • Fall Symposia
    • Code of Conduct for Conferences and Events
  • PublicationsPublications
    • AAAI Press
    • AI Magazine
    • Conference Proceedings
    • AAAI Publication Policies & Guidelines
    • Request to Reproduce Copyrighted Materials
  • aaai-icon_ai-magazine-line-yellowAI Magazine
    • Issues and Articles
    • Author Guidelines
    • Editorial Focus
  • MembershipMembership
    • Member Login
    • Developing Country List
    • AAAI Chapter Program

  • Career CenterCareer Center
  • aaai-icon_ai-topics-line-yellowAITopics
  • aaai-icon_contact-line-yellowContact

Home / Proceedings / Proceedings of the International Symposium on Combinatorial Search /

Vol. 5 No. 1 (2014): Seventh Annual Symposium on Combinatorial Search

Frontmatter

  • SoCS 2014 Organization

    Stefan Edelkamp,Roman Bartak

    viii-ix

    PDF
  • Invited Talks

    Sven Koenig,Alexander Reinefeld

    x

    PDF
  • Preface

    Stefan Edelkamp,Roman Bartak

    xi-xii

    PDF

Full Papers

  • Latent Features for Algorithm Selection

    Yuri Malitsky,Barry O'Sullivan

    123-130

    PDF
  • Extended Framework for Target Oriented Network Intelligence Collection

    Liron Samama-Kachko,Rami Puzis,Roni Stern,Ariel Felner

    131-138

    PDF
  • Balancing Exploration and Exploitation in Classical Planning

    Tim Schulte,Thomas Keller

    139-147

    PDF
  • Max Is More than Min: Solving Maximization Problems with Heuristic Search

    Roni Stern,Scott Kiesel,Rami Puzis,Ariel Felner,Wheeler Ruml

    148-156

    PDF
  • Fast First-Move Queries through Run-Length Encoding

    Ben Strasser,Daniel Harabor,Adi Botea

    157-165

    PDF
  • Reaching the Goal in Real-Time Heuristic Search: Scrubbing Behavior is Unavoidable

    Nathan Sturtevant,Vadim Bulitko

    166-174

    PDF
  • Exploiting the Rubik’s Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters

    Nathan Sturtevant,Ariel Felner,Malte Helmert

    175-183

    PDF
  • Speedy Versus Greedy Search

    Christopher Wilt,Wheeler Ruml

    184-192

    PDF
  • Handling All Unit Propagation Reasons in Exact Max-SAT Solvers

    Andre Abrame,Djamal Habet

    44966

    PDF
  • On Different Strategies for Eliminating Redundant Actions from Plans

    Tomáš Balyo,Lukáš Chrpa,Asma Kilani

    45217

    PDF
  • Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem

    Max Barer,Guni Sharon,Roni Stern,Ariel Felner

    19-27

    PDF
  • On the Attainability of NK Landscapes Global Optima

    Matthieu Basseur,Adrien Goëffon,Frédéric Lardeux,Frédéric Saubion,Vincent Vigneron

    28-34

    PDF
  • Hybrid Planning Heuristics Based on Task Decomposition Graphs

    Pascal Bercher,Shawn Keen,Susanne Biundo

    35-43

    PDF
  • A* with Lookahead Re-Evaluated

    Zhaoxing Bu,Roni Stern,Ariel Felner,Robert Holte

    44-52

    PDF
  • Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions

    Gaojian Fan,Martin Müller,Robert Holte

    53-61

    PDF
  • ReACT: Real-Time Algorithm Configuration through Tournaments

    Tadhg Fitzgerald,Yuri Malitsky,Barry O’Sullivan,Kevin Tierney

    62-70

    PDF
  • Evaluating Weighted DFS Branch and Bound over Graphical Models

    Natalia Flerova,Radu Marinescu,Rina Dechter

    71-79

    PDF
  • Anytime Tree-Restoring Weighted A* Graph Search

    Kalin Gochev,Alla Safonova,Maxim Likhachev

    80-88

    PDF
  • Bounded Suboptimal Search in Linear Space: New Results

    Matthew Hatem,Wheeler Ruml

    89-96

    PDF
  • Time-Bounded Best-First Search

    Carlos Hernandez,Roberto Asin,Jorge Baier

    97-104

    PDF
  • Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics

    William Lam,Kalev Kask,Rina Dechter,Alexander Ihler

    105-113

    PDF
  • Estimating Search Tree Size with Duplicate Detection

    Levi Lelis,Roni Stern,Nathan Sturtevant

    114-122

    PDF

Research Abstracts

  • The Application of Pareto Local Search to the Single-Objective Quadratic Assignment Problem

    Abdullah Alsheddy

    194-195

    PDF
  • Improved Heuristic Search for Sparse Motion Planning Data Structures

    Andrew Dobson,Kostas Bekris

    196-197

    PDF
  • Toward a Search Strategy for Anytime Search in Linear Space Using Depth-First Branch and Bound

    Carlos Hernandez,Jorge Baier

    198-199

    PDF
  • How Do You Know Your Search Algorithm and Code Are Correct?

    Richard Korf

    200-201

    PDF
  • Solving the Target-Value Search Problem

    Carlos Linares López,Roni Stern,Ariel Felner

    202-203

    PDF
  • STLS: Cycle-Cutset-Driven Local Search For MPE

    Alon Milchgrub,Rina Dechter

    204-205

    PDF

Extended Abstracts

  • Multi-Heuristic A*

    Sandip Aine,Siddharth Swaminathan,Venkatraman Narayanan,Victor Hwang,Maxim Likhachev

    207-208

    PDF
  • Exponential Deepening A* for Real-Time Agent-Centered Search

    Guni Sharon,Ariel Felner,Nathan Sturtevant

    209-210

    PDF
  • Identifying Hierarchies for Fast Optimal Search

    Tansel Uras,Sven Koenig

    211-212

    PDF

Primary Sidebar