Sciweavers

683 search results - page 58 / 137
» Coarticulation in Markov Decision Processes
Sort
View
ECSQARU
2001
Springer
14 years 2 months 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
14 years 1 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
EXACT
2008
14 years 13 days ago
Explaining recommendations generated by MDPs
There has been little work in explaining recommendations generated by Markov Decision Processes (MDPs). We analyze the difculty of explaining policies computed automatically and id...
Omar Zia Khan, Pascal Poupart, James P. Black
FLAIRS
2008
14 years 13 days ago
Planning for Welfare to Work
We are interested in building decision-support software for social welfare case managers. Our model in the form of a factored Markov decision process is so complex that a standard...
Liangrong Yi, Raphael A. Finkel, Judy Goldsmith
AAAI
2010
13 years 11 months ago
Compressing POMDPs Using Locality Preserving Non-Negative Matrix Factorization
Partially Observable Markov Decision Processes (POMDPs) are a well-established and rigorous framework for sequential decision-making under uncertainty. POMDPs are well-known to be...
Georgios Theocharous, Sridhar Mahadevan