36 search results - page 2 / 8 » Using Linear Programming for Bayesian Exploration in Markov ... |
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
13 years 6 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
DAC
2000
ACM
14 years 6 months ago
2000
ACM
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...
VTC
2008
IEEE
13 years 12 months ago
2008
IEEE
—This paper studies the admission control and resource allocation in a cell-based wireless system that supports singlemedia and multirate services. Utilizing the idea of adaptive...
ICML
2008
IEEE
14 years 6 months ago
2008
IEEE
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
AIPS
2006
13 years 6 months ago
2006
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...