R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
Ronen I. Brafman and Moshe Tennenholtz

R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning.pdf 101.23kB
Type: Paper
Tags:

Bibtex: 
@article{3:9,author={Ronen I. Brafman and Moshe Tennenholtz}, Title={R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning},journal={Journal of Machine Learning Research},volume={3}, url={http://www.jmlr.org/papers/volume3/herbrich02a/errata.pdf}}
Report
Send Feedback Start
   0.000005
DB Connect
   0.000351
Lookup hash in DB
   0.000607
Get torrent details
   0.000615
Get torrent details, finished
   0.000614
Get authors
   0.000006
Select authors
   0.000415
Parse bibtex
   0.000112
Write header
   0.000542
get stars
   0.000372
home tab
   0.000383
render right panel
   0.000011
render ads
   0.000049
fetch current hosters
   0.001996
Done