Search

Search Results

• Incremental LM-Cut

  Florian Pommerening, Malte Helmert

  162-170

  2013-06-02

• Scheduling with Contingent Resources and Tasks

  Jussi Rintanen

  189-196

  2013-06-02

• Transition Trees for Cost-Optimal Symbolic Planning

  Álvaro Torralba, Stefan Edelkamp, Peter Kissmann

  206-214

  2013-06-02

• Trial-Based Heuristic Tree Search for Finite Horizon MDPs

  Thomas Keller, Malte Helmert

  135-143

  2013-06-02

• Multi-Modal Journey Planning in the Presence of Uncertainty

  Adi Botea, Evdokia Nikolova, Michele Berlingerio

  20-28

  2013-06-02

• A Generic Technique for Synthesizing Bounded Finite-State Controllers

  Yuxiao Hu, Giuseppe De Giacomo

  109-116

  2013-06-02

• Exploiting Fully Observable and Deterministic Structures in Goal POMDPs

  Håkan Warnquist, Jonas Kvarnström, Patrick Doherty

  242-250

  2013-06-02

• New Encoding Methods for SAT-Based Temporal Planning

  Masood Feyzbakhsh Rankooh, Gholamreza Ghassem-Sani

  73-81

  2013-06-02

• Hybrid Queueing Theory and Scheduling Models for Dynamic Environments with Sequence-Dependent Setup Times

  Tony Tran, Daria Terekhov, Doug Down, J. Beck

  215-223

  2013-06-02

• Distributed Algorithms for Incrementally Maintaining Multiagent Simple Temporal Networks

  James Boerkoel Jr., Léon Planken, Ronald Wilcox, Julie Shah

  11-19

  2013-06-02

• When Acyclicity Is Not Enough: Limitations of the Causal Graph

  Anders Jonsson, Peter Jonsson, Tomas Lööw

  117-125

  2013-06-02

• Partially Grounded Planning as Quantified Boolean Formula

  Michael Cashmore, Maria Fox, Enrico Giunchiglia

  29-36

  2013-06-02

• Who Said We Need to Relax All Variables?

  Michael Katz, Joerg Hoffmann, Carmel Domshlak

  126-134

  2013-06-02

• Behavior Composition as Fully Observable Non-Deterministic Planning

  Miquel Ramirez, Nitin Yadav, Sebastian Sardina

  180-188

  2013-06-02

• Fault Tolerant Planning: Complexity and Compilation

  Carmel Domshlak

  64-72

  2013-06-02

• Abstractions for Oversubscription Planning

  Vitaly Mirkis, Carmel Domshlak

  153-161

  2013-06-02

• Optimally Scheduling Small Numbers of Identical Parallel Machines

  Richard Korf, Ethan Schreiber

  144-152

  2013-06-02

• Better Time Constrained Search via Randomization and Postprocessing

  Fan Xie, Richard Valenzano, Martin Müller

  269-277

  2013-06-02

• An Efficient Memetic Algorithm for the Flexible Job Shop with Setup Times

  Miguel Ángel González, Camino Rodríguez Vela, Ramiro Varela

  91-99

  2013-06-02

• Searching for Good Solutions in Goal-Dense Search Spaces

  Amanda Coles, Andrew Coles

  37-45

  2013-06-02

• Compiling Conformant Probabilistic Planning Problems into Classical Planning

  Ran Taig, Ronen I. Brafman

  197-205

  2013-06-02

• Constricting Insertion Heuristic for Traveling Salesman Problem with Neighborhoods

  Sergey Alatartsev, Marcus Augustine, Frank Ortmeier

  2-10

  2013-06-02

• Learning Portfolios of Automatically Tuned Planners

  Jendrik Seipp, Manuel Braun, Johannes Garimort, Malte Helmert

  368-372

  2012-05-14

• Optimally Relaxing Partial-Order Plans with MaxSAT

  Christian Muise, Sheila McIlraith, Christopher Beck

  358-362

  2012-05-14

• Optimizing Plans through Analysis of Action Dependencies and Independencies

  Lukáš Chrpa, Thomas McCluskey, Hugh Osborne

  338-342

  2012-05-14