520 search results - page 9 / 104 » New Complexity Results for Classical Planning Benchmarks |
ECAI
2010
Springer
13 years 7 months ago
2010
Springer
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Personalized search systems have evolved to utilize heterogeneous features including document hyperlinks, category labels in various taxonomies and social tags in addition to free...
ICTAI
2010
IEEE
13 years 5 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
PUK
2000
13 years 8 months ago
2000
GraphPlan-like and SATPLAN-like planners have shown to outperform classical planners for most of the classical planning domains. However, these two propositional approaches do not ...
AIPS
2007
13 years 9 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...