520 search results - page 4 / 104 » New Complexity Results for Classical Planning Benchmarks |
ICTAI
2005
IEEE
14 years 28 days ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
ATMOS
2010
13 years 6 months ago
2010
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Temporal dependence within the workload of any computing or networking system has been widely recognized as a significant factor affecting performance. More specifically, burstin...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper, a new meta-method based on the physical nuclear process is presented. This meta-method called Fusion-Fission is applied to the two different class of graph parti...
AIPS
2004
13 years 8 months ago
2004
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 ...