• 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. 4 No. 1 (2013): Sixth Annual Symposium on Combinatorial Search

Frontmatter

  • SoCS 2013 Organization

    Malte Helmert,Gabriele Röger

    viii-ix

    PDF
  • Preface

    Malte Helmert,Gabriele Röger

    xi-xii

    PDF
  • Invited Speakers

    J. Beck,Gene Cooperman

    x

    PDF

Full Papers

  • Bounded Suboptimal Heuristic Search in Linear Space

    Matthew Hatem,Roni Stern,Wheeler Ruml

    98-104

    PDF
  • Red-Black Relaxed Plan Heuristics Reloaded

    Michael Katz,Joerg Hoffmann

    105-113

    PDF
  • From Feasibility Tests to Path Planners for Multi-Agent Pathfinding

    Athanasios Krontiris,Ryan Luna,Kostas Bekris

    114-122

    PDF
  • Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics

    Levi Lelis

    123-132

    PDF
  • Evolving Instance Specific Algorithm Configuration

    Yuri Malitsky,Deepak Mehta,Barry O'Sullivan

    133-140

    PDF
  • Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases

    André Pereira,Marcus Ritt,Luciana Buriol

    141-148

    PDF
  • GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials

    Naina Razakarison,Mats Carlsson,Nicolas Beldiceanu,Helmut Simonis

    149-157

    PDF
  • Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search

    Nicolas Rivera,Leon Illanes,Jorge Baier,Carlos Hernandez

    158-166

    PDF
  • Online Detection of Dead States in Real-Time Agent-Centered Search

    Guni Sharon,Nathan Sturtevant,Ariel Felner

    167-174

    PDF
  • Constrained Symbolic Search: On Mutexes, BDD Minimization and More

    Álvaro Torralba,Vidal Alcázar

    175-183

    PDF
  • Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners

    Mauro Vallati,Chris Fawcett,Alfonso Gerevini,Holger Hoos,Alessandro Saetti

    184-192

    PDF
  • Planning Paths with Fewer Turns on Grid Maps

    Hu Xu,Lei Shu,May Huang

    193-200

    PDF
  • Anytime Truncated D* : Anytime Replanning with Truncation

    Sandip Aine,Maxim Likhachev

    44967

    PDF
  • An Analysis Framework for Examination Timetabling

    Taha Arbaoui,Jean-Paul Boufflet,Aziz Moukrim

    45249

    PDF
  • Parallelising the k-Medoids Clustering Problem Using Space-Partitioning

    Alejandro Arbelaez,Luis Quesada

    20-28

    PDF
  • Fast Detection of Unsolvable Planning Instances Using Local Consistency

    Christer Bäckström,Peter Jonsson,Simon Ståhlberg

    29-37

    PDF
  • Multi-Agent Path Finding for Self Interested Agents

    Zahy Bnaya,Roni Stern,Ariel Felner,Roie Zivan,Steven Okamoto

    38-46

    PDF
  • Experimental Real-Time Heuristic Search Results in a Video Game

    Ethan Burns,Scott Kiesel,Wheeler Ruml

    47-54

    PDF
  • Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates Is Moderate

    John Dickerson,Tuomas Sandholm

    55-62

    PDF
  • To UCT, or not to UCT? (Position Paper)

    Carmel Domshlak,Zohar Feldman

    63-70

    PDF
  • Multi-Hop Ride Sharing

    Florian Drews,Dennis Luxen

    71-79

    PDF
  • Bidirectional Preference-Based Search for State Space Graph Problems

    Lucie Galand,Anisse Ismaili,Patrice Perny,Olivier Spanjaard

    80-88

    PDF
  • Optimal-Generation Variants of EPEA*

    Meir Goldenberg,Ariel Felner,Nathan Sturtevant,Robert C. Holte,Jonathan Schaeffer

    89-97

    PDF

Research Abstracts

  • Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract)

    Faten Aljalaud,Nathan Sturtevant

    203-204

    PDF
  • Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract)

    Hannah Bast,Sabine Storandt

    205-206

    PDF
  • Multi-Agent Planning with Mixed-Integer Programming and Adaptive Interaction Constraint Generation (Extended Abstract)

    Jan-P. Calliess,Stephen Roberts

    207-208

    PDF
  • The Hierarchy in Grid Graphs (Extended Abstract)

    Sabine Storandt

    209-210

    PDF

Extended Abstracts

  • Target-Value Search Revisited (Extended Abstract)

    Carlos Linares López,Roni Stern,Ariel Felner

    216-217

    PDF
  • Candidate Sets for Alternative Routes in Road Networks (Extended Abstract)

    Dennis Luxen,Dennis Schieferdecker

    218-219

    PDF
  • Towards Rational Deployment of Multiple Heuristics in A* (Extended Abstract)

    David Tolpin,Tal Beja,Solomon Eyal Shimony,Ariel Felner,Erez Karpas

    220-221

    PDF
  • Customizable Route Planning in Road Networks (Extended Abstract)

    Daniel Delling,Andrew Goldberg,Thomas Pajor,Renato Werneck

    212

    PDF
  • Round-Based Public Transit Routing (Extended Abstract)

    Daniel Delling,Thomas Pajor,Renato Werneck

    213

    PDF
  • Polynomial-Time Construction of Contraction Hierarchies for Multi-Criteria Objectives

    Stefan Funke,Sabine Storandt

    214-215

    PDF

Primary Sidebar