Sciweavers

283 search results - page 18 / 57
» Incremental Deterministic Planning
Sort
View
AIPS
2010
13 years 10 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
AIPS
2006
13 years 10 months ago
A New Principle for Incremental Heuristic Search: Theoretical Results
Planning is often not a one-shot task because either the world or the agent's knowledge of the world changes. In this paper, we introduce a new principle that can be used to ...
Sven Koenig, Maxim Likhachev
ICDE
2010
IEEE
167views Database» more  ICDE 2010»
13 years 9 months ago
Top-k pipe join
Abstract—In the context of service composition and orchestration, service invocation is typically scheduled according to execution plans, whose topology establishes whether diffe...
Davide Martinenghi, Marco Tagliasacchi
ICML
2008
IEEE
14 years 9 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
ICSE
2007
IEEE-ACM
14 years 8 months ago
Spotlight: A Prototype Tool for Software Plans
Software evolution is made difficult by the need to integrate new features with all previously implemented features in the system. We present Spotlight, a prototype editor for sof...
David Coppit, Robert R. Painter, Meghan Revelle