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.000006
DB Connect
   0.000647
Lookup hash in DB
   0.000555
Get torrent details
   0.000192
Get torrent details, finished
   0.000304
Get authors
   0.000000
Select authors
   0.000255
Parse bibtex
   0.000109
Write header
   0.000289
get stars
   0.000162
home tab
   0.000155
render right panel
   0.000006
render ads
   0.000628
fetch current hosters
   0.000381
related datasets
   0.001950
Done