Sciweavers

829 search results - page 8 / 166
» A time aggregation approach to Markov decision processes
Sort
View
74
Voted
TALG
2010
73views more  TALG 2010»
14 years 8 months ago
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...
Omid Madani, Mikkel Thorup, Uri Zwick
86
Voted
FCCM
2006
IEEE
106views VLSI» more  FCCM 2006»
15 years 3 months ago
Scalable Hardware Architecture for Real-Time Dynamic Programming Applications
Abstract— This paper introduces a novel architecture for performing the core computations required by dynamic programming (DP) techniques. The latter pertain to a vast range of a...
Brad Matthews, Itamar Elhanany
74
Voted
AAAI
2006
14 years 11 months ago
Learning Representation and Control in Continuous Markov Decision Processes
This paper presents a novel framework for simultaneously learning representation and control in continuous Markov decision processes. Our approach builds on the framework of proto...
Sridhar Mahadevan, Mauro Maggioni, Kimberly Fergus...
AAAI
2006
14 years 11 months ago
Hard Constrained Semi-Markov Decision Processes
In multiple criteria Markov Decision Processes (MDP) where multiple costs are incurred at every decision point, current methods solve them by minimising the expected primary cost ...
Wai-Leong Yeow, Chen-Khong Tham, Wai-Choong Wong
ICC
2007
IEEE
137views Communications» more  ICC 2007»
15 years 3 months ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy