Sciweavers

334 search results - page 51 / 67
» How to Dynamically Merge Markov Decision Processes
Sort
View
AI
2006
Springer
15 years 1 months ago
Belief Selection in Point-Based Planning Algorithms for POMDPs
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
Masoumeh T. Izadi, Doina Precup, Danielle Azar
ICRA
2010
IEEE
97views Robotics» more  ICRA 2010»
14 years 8 months ago
Probabilistic motion planning of balloons in strong, uncertain wind fields
—This paper introduces a new algorithm for probabilistic motion planning in arbitrary, uncertain vector fields, with emphasis on high-level planning for Montgolfier´e balloons...
Michael T. Wolf, Lars Blackmore, Yoshiaki Kuwata, ...
WCNC
2008
IEEE
15 years 4 months ago
ECHO: A Quality of Service Based Endpoint Centric Handover Scheme for VoIP
– Existing terminal oriented handover mechanisms capable of meeting the strict delay bounds of real time applications such as VoIP do not consider the QoS of candidate handover n...
John Fitzpatrick, Seán Murphy, Mohammed Ati...
APCCM
2008
14 years 11 months ago
Making Workflows Context-aware: A Way to Support Knowledge-intensive Tasks
In business processes, knowledge-intensive tasks are ones in which the people performing such tasks are involved in a fair degree of uncertainty. These people are required to appl...
Mitra Heravizadeh, David Edmond
ICDCS
2008
IEEE
15 years 4 months ago
Enabling Accurate Node Control in Randomized Duty Cycling Networks
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
Kang-Won Lee, Vasileios Pappas, Asser N. Tantawi