Sciweavers

252 search results - page 33 / 51
» Multiagent Planning with Partially Ordered Temporal Plans
Sort
View
FLAIRS
2009
13 years 5 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
14 years 1 months ago
Route skyline queries: A multi-preference path planning approach
— In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects bein...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...
ATAL
2008
Springer
13 years 9 months ago
Extending agent languages for autonomy
BDI agent languages provide a useful abstraction for complex systems comprised of interactive autonomous entities, but they have been used mostly in the context of single agents w...
Felipe Rech Meneguzzi
EDBT
2004
ACM
162views Database» more  EDBT 2004»
14 years 7 months ago
Non-contiguous Sequence Pattern Queries
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
Nikos Mamoulis, Man Lung Yiu
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 8 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden