Sciweavers

499 search results - page 63 / 100
» Model Minimization in Markov Decision Processes
Sort
View
IJCAI
2003
13 years 10 months ago
Multiple-Goal Reinforcement Learning with Modular Sarsa(0)
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
Nathan Sprague, Dana H. Ballard
ALDT
2009
Springer
140views Algorithms» more  ALDT 2009»
14 years 3 months ago
Directional Decomposition of Multiattribute Utility Functions
Abstract. Several schemes have been proposed for compactly representing multiattribute utility functions, yet none seems to achieve the level of success achieved by Bayesian and Ma...
Ronen I. Brafman, Yagil Engel
ICN
2007
Springer
14 years 2 months ago
Heuristic Approach of Optimal Code Allocation in High Speed Downlink Packet Access Networks
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadar...
AAAI
2008
13 years 11 months ago
Interaction Structure and Dimensionality Reduction in Decentralized MDPs
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
Martin Allen, Marek Petrik, Shlomo Zilberstein
WSC
2008
13 years 11 months ago
On step sizes, stochastic shortest paths, and survival probabilities in Reinforcement Learning
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
Abhijit Gosavi