169 search results - page 7 / 34 » Tractability of Planning with Loops |
GI
2007
Springer
13 years 11 months ago
2007
Springer
: The decomposition of planning and scheduling problems is a well known technique to make these problems tractable. The resulting dependable subproblems were often solved using dif...
AIPS
1994
13 years 8 months ago
1994
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
ICDE
2009
IEEE
14 years 2 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
GEOINFORMATICA
2000
13 years 7 months ago
2000
: Transportation systems exist to improve individual accessibility. However, emerging applications of GIS in transportation (GIS-T) and intelligent transportation system (ITS) focu...
WOLLIC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a domain-independent algorithm for planning that computes macros in a novel way. Our algorithm computes macros “on-the-fly” for a given set of states and ...