Sciweavers

55 search results - page 3 / 11
» Fast Transformation of Temporal Plans for Efficient Executio...
Sort
View
ATAL
2000
Springer
13 years 9 months ago
Planning-Task Transformations for Soft Deadlines
Agents often have preference models that are more complicated than minimizing the expected execution cost. In this paper, we study how they should act in the presence of uncertaint...
Sven Koenig
IJCAI
1989
13 years 6 months ago
Managing Efficiently Temporal Relations Through Indexed Spanning Trees
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou­ sand time-tokens in demanding applications su...
Malik Ghallab, A. Mounir Alaoui
AIPS
2004
13 years 6 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
AI
2008
Springer
13 years 5 months ago
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina

Publication
309views
15 years 5 months ago
SOLE: Scalable On-Line Execution of Continuous Queries on Spatio-temporal Data Streams
This paper presents the Scalable On-Line Execution algorithm (SOLE, for short) for continuous and on-line evaluation of concurrent continuous spatio- temporal queries over data str...
Mohamed F. Mokbel, Walid G. Aref