1068 search results - page 99 / 214 » On Space Bounded Server Algorithms |
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
ADC
2009
Springer
14 years 2 months ago
2009
Springer
In this work an R-tree variant, which uses minimum volume covering ellipsoids instead of usual minimum bounding rectangles, is presented. The most significant aspects, which dete...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— Research on numerical solution methods for partially observable Markov decision processes (POMDPs) has primarily focused on discrete-state models, and these algorithms ...
ECCV
2010
Springer
14 years 24 days ago
2010
Springer
As it has been noted several times in literature, the difficult part of autocalibration efforts resides in the structural non-linearity of the search for the plane at infinity. I...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We show that for every α > 0, there exist n-point metric spaces (X, d) where every “scale” admits a Euclidean embedding with distortion at most α, but the whole space req...