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
Compute download stats
Related Torrents
Report
Send Feedback Start
   0.000007
DB Connect
   0.000532
Lookup hash in DB
   0.000414
Get torrent details
   0.000143
Get torrent details, finished
   0.000234
Get authors
   0.000001
Select authors
   0.000200
Parse bibtex
   0.000102
Write header
   0.000216
get stars
   0.000115
home tab
   0.000126
render right panel
   0.000005
render ads
   0.000410
fetch current hosters
   0.000235
related datasets
   0.001302
Done