Sciweavers

1138 search results - page 45 / 228
» Feature Markov Decision Processes
Sort
View
AIPS
2006
14 years 10 days ago
Automated Planning Using Quantum Computation
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
Sanjeev Naguleswaran, Langford B. White, I. Fuss
AIPS
2003
14 years 10 days ago
Synthesis of Hierarchical Finite-State Controllers for POMDPs
We develop a hierarchical approach to planning for partially observable Markov decision processes (POMDPs) in which a policy is represented as a hierarchical finite-state control...
Eric A. Hansen, Rong Zhou
SOCIALCOM
2010
13 years 8 months ago
A Decision Theoretic Approach to Data Leakage Prevention
Abstract--In both the commercial and defense sectors a compelling need is emerging for rapid, yet secure, dissemination of information. In this paper we address the threat of infor...
Janusz Marecki, Mudhakar Srivatsa, Pradeep Varakan...
ATAL
2007
Springer
14 years 5 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
ENTCS
2006
134views more  ENTCS 2006»
13 years 11 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...