1146 search results - page 53 / 230 » On the Complexity of Domain-Independent Planning |
AIPS
2006
13 years 9 months ago
2006
Strong Cyclic Planning aims at generating iterative plans that only allow loops so far as there is a chance to reach the goal. The problem is already significantly complex for ful...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
DFG
2007
Springer
14 years 2 months ago
2007
Springer
: In urban planning, sophisticated simulation models are key tools to estimate future population growth for measuring the impact of planning decisions on urban developments and the...
ISPD
2003
ACM
14 years 1 months ago
2003
ACM
Previous works on buffer planning are mainly based on fixed die placement. It is necessary to reduce the complexity of computing the feasible buffer insertion sites to integrate t...
WADS
1997
Springer
13 years 12 months ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...