520 search results - page 11 / 104 » New Complexity Results for Classical Planning Benchmarks |
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
ALGORITHMICA
2000
13 years 7 months ago
2000
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
ADBIS
2000
Springer
13 years 11 months ago
2000
Springer
The majority of database benchmarks currently in use in the industry were designed for relational databases. A different class of benchmarks became required for object oriented dat...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--The growing complexity in computer system hierarchies due to the increase in the number of cores per processor, levels of cache (some of them shared) and the number of pr...