Sciweavers

337 search results - page 29 / 68
» Mean-Variance Optimization in Markov Decision Processes
Sort
View
ECML
2007
Springer
14 years 1 months ago
Safe Q-Learning on Complete History Spaces
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observat...
Stephan Timmer, Martin Riedmiller
GECCO
2004
Springer
142views Optimization» more  GECCO 2004»
14 years 1 months ago
Improving MACS Thanks to a Comparison with 2TBNs
Abstract. Factored Markov Decision Processes is the theoretical framework underlying multi-step Learning Classifier Systems research. This framework is mostly used in the context ...
Olivier Sigaud, Thierry Gourdin, Pierre-Henri Wuil...
ECSQARU
2001
Springer
14 years 6 days ago
Space-Progressive Value Iteration: An Anytime Algorithm for a Class of POMDPs
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...
Nevin Lianwen Zhang, Weihong Zhang
APNOMS
2006
Springer
13 years 11 months ago
Network-Adaptive QoS Routing Using Local Information
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
Jeongsoo Han
ICMLA
2008
13 years 9 months ago
Prediction-Directed Compression of POMDPs
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...