Sciweavers

1941 search results - page 31 / 389
» The representation of planning strategies
Sort
View
AIPS
2010
13 years 10 months ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
AIPS
2011
12 years 11 months ago
Directed Search for Generalized Plans Using Classical Planners
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
CCIA
2005
Springer
14 years 1 months ago
A Preliminary Study on the Relaxation of Numeric Features in Planning
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...
Antonio Garrido, Eva Onaindia, Donato Herná...
ICDE
2006
IEEE
127views Database» more  ICDE 2006»
14 years 1 months ago
Processing Recursive XQuery over XML Streams: The Raindrop Approach
— XML stream applications bring the challenge of efficiently processing queries on sequentially accessible tokenbased data. For efficient processing of queries, we need to ensu...
Mingzhu Wei, Ming Li, Elke A. Rundensteiner, Mural...
ICTAI
2005
IEEE
14 years 1 months ago
Subgoal Ordering and Granularity Control for Incremental Planning
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...
Chih-Wei Hsu, Yixin Chen