Sciweavers

101 search results - page 8 / 21
» Reviving Partial Order Planning
Sort
View
UAI
2008
13 years 8 months ago
Sampling First Order Logical Particles
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
Hannaneh Hajishirzi, Eyal Amir
VLDB
2005
ACM
85views Database» more  VLDB 2005»
14 years 6 days ago
Pattern Tree Algebras: Sets or Sequences?
XML and XQuery semantics are very sensitive to the order of the produced output. Although pattern-tree based algebraic approaches are becoming more and more popular for evaluating...
Stelios Paparizos, H. V. Jagadish
AAAI
1997
13 years 8 months ago
Planning with Concurrent Interacting Actions
In order to generate plans for agents with multiple actuators or agent teams, we must be able to represent and plan using concurrent actions with interacting effects. Historically...
Craig Boutilier, Ronen I. Brafman
PUK
2000
13 years 8 months ago
Scheduling in a Planning Environment
In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan....
Antonio Garrido Tejero, Miguel A. Salido, Federico...
LOGCOM
2011
12 years 9 months ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea