Sciweavers

656 search results - page 21 / 132
» Complexity of finite-horizon Markov decision process problem...
Sort
View
IROS
2009
IEEE
206views Robotics» more  IROS 2009»
15 years 8 months ago
Bayesian reinforcement learning in continuous POMDPs with gaussian processes
— Partially Observable Markov Decision Processes (POMDPs) provide a rich mathematical model to handle realworld sequential decision processes but require a known model to be solv...
Patrick Dallaire, Camille Besse, Stéphane R...
IJCAI
2001
15 years 3 months ago
Adaptive Control of Acyclic Progressive Processing Task Structures
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
Stéphane Cardon, Abdel-Illah Mouaddib, Shlo...
103
Voted
CATS
2007
15 years 3 months ago
Effective Prediction and its Computational Complexity
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
Richard Taylor
111
Voted
ICIP
1998
IEEE
16 years 3 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson
AAAI
1996
15 years 3 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: 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...
Craig Boutilier, David Poole