337 search results - page 23 / 68 » An Anytime Algorithm for Decision Making under Uncertainty |
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
13 years 9 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...
IJCAI
2003
13 years 9 months ago
2003
To model combinatorial decision problems involving uncertainty and probability, we extend the stochastic constraint programming framework proposed in [Walsh, 2002] along a number ...
AIPS
2008
13 years 10 months ago
2008
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
FLAIRS
2007
13 years 10 months ago
2007
In attempting to address real-life decision problems, where uncertainty about input data prevails, some kind of representation of imprecise information is important and several ha...