515 search results - page 20 / 103 » Approximating Markov Processes by Averaging |
114
click to vote
TASE
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract--The use of automated guided vehicles (AGVs) in material-handling processes of manufacturing facilities and warehouses isbecomingincreasinglycommon.AcriticaldrawbackofanAG...
104
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
104
click to vote
PPAM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
197
click to vote
Book
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
127
click to vote
ICML
2006
IEEE
2006
IEEE
Automatic basis function construction for approximate dynamic programming and reinforcement learning
15 years 5 months ago
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...