84 search results - page 1 / 17 » A New Perspective on Algorithms for Optimizing Policies unde... |
71
Voted
AIPS
2000
14 years 11 months ago
2000
The paper takes a fresh look at algorithms for maximizing expected utility over a set of policies, that is, a set of possible ways of reacting to observations about an uncertain s...
UAI
1998
14 years 10 months ago
1998
We present an anytime algorithm which computes policies for decision problems represented as multi-stage influence diagrams. Our algorithm constructs policies incrementally, start...
101
click to vote
RSS
2007
14 years 11 months ago
2007
Abstract— This paper proposes a simulation-based active policy learning algorithm for finite-horizon, partially-observed sequential decision processes. The algorithm is tested i...
115
click to vote
SIGMETRICS
2012
ACM
12 years 12 months ago
2012
ACM
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
14 years 10 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...