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}}
No stats to report yet.
Related Torrents
Report
Send Feedback Start
   0.000004
DB Connect
   0.000435
Lookup hash in DB
   0.000385
Get torrent details
   0.000118
Get torrent details, finished
   0.000213
Get authors
   0.000001
Select authors
   0.000189
Parse bibtex
   0.000040
Write header
   0.000187
get stars
   0.000115
home tab
   0.000103
render right panel
   0.000008
render ads
   0.000359
fetch current hosters
   0.000235
Start get stats
   0.000308
End get stats
   0.000001
related datasets
   0.001141
Done