Sciweavers

122 search results - page 23 / 25
» An Algorithm for Probabilistic Least-Commitment Planning
Sort
View
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
15 years 3 months ago
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...
HRI
2007
ACM
15 years 1 months ago
Efficient model learning for dialog management
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
Finale Doshi, Nicholas Roy
MOBIHOC
2005
ACM
15 years 9 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
JAIR
2008
148views more  JAIR 2008»
14 years 9 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
AGENTS
2001
Springer
15 years 2 months ago
Monitoring deployed agent teams
Recent years are seeing an increasing need for on-line monitoring of deployed distributed teams of cooperating agents, e.g., for visualization, or performance tracking. However, i...
Gal A. Kaminka, David V. Pynadath, Milind Tambe