Sciweavers

30 search results - page 3 / 6
» aips 2004
Sort
View
AIPS
2004
13 years 7 months ago
Complexity of Planning with Partial Observability
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
Jussi Rintanen
AIPS
2004
13 years 7 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
AIPS
2004
13 years 7 months ago
An Empirical Analysis of Some Heuristic Features for Local Search in LPG
LPG is a planner that performed very well in the last International planning competition (2002). The system is based on a stochastic local search procedure, and it incorporates se...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
AIPS
2004
13 years 7 months ago
Statistical Goal Parameter Recognition
We present components of a system which uses statistical, corpus-based machine learning techniques to perform instantiated goal recognition -- recognition of both a goal schema an...
Nate Blaylock, James F. Allen
AIPS
2004
13 years 7 months ago
Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing tasks when enough resources are not available. Prior AI approaches have mostly been constructive or repairbased heuristic searc...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...