Sciweavers

135 search results - page 21 / 27
» Dynamic Workflow Composition using Markov Decision Processes
Sort
View
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 7 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
JSAC
2010
107views more  JSAC 2010»
13 years 6 months ago
Online learning in autonomic multi-hop wireless networks for transmitting mission-critical applications
Abstract—In this paper, we study how to optimize the transmission decisions of nodes aimed at supporting mission-critical applications, such as surveillance, security monitoring,...
Hsien-Po Shiang, Mihaela van der Schaar
NIPS
2001
13 years 9 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr
ICMLA
2009
13 years 5 months ago
Sensitivity Analysis of POMDP Value Functions
In sequential decision making under uncertainty, as in many other modeling endeavors, researchers observe a dynamical system and collect data measuring its behavior over time. The...
Stéphane Ross, Masoumeh T. Izadi, Mark Merc...
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 2 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith