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:

Metadata: 
@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}}
Citation:
Brafman, R. I. & Tennenholtz, M.. (2014). R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning [Data set]. Academic Torrents. https://academictorrents.com/details/3699dda91f82f2c6083f50166e3675779762ee93
No stats to report yet.
Related Torrents
Report
Send Feedback Start
   0.000008
DB Connect
   0.000679
Lookup hash in DB
   0.000672
Get torrent details
   0.000166
Get torrent details, finished
   0.000247
Get authors
   0.000000
Select authors
   0.000205
Parse bibtex
   0.000115
Write header
   0.000251
get stars
   0.000113
home tab
   0.000102
render right panel
   0.000005
render ads
   0.000499
fetch current hosters
   0.000346
Start get stats
   0.000541
End get stats
   0.000003
related datasets
   0.001627
Done