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.000008
DB Connect
   0.000737
Lookup hash in DB
   0.000555
Get torrent details
   0.000178
Get torrent details, finished
   0.000322
Get authors
   0.000001
Select authors
   0.000229
Parse bibtex
   0.000145
Write header
   0.000273
get stars
   0.000153
home tab
   0.000144
render right panel
   0.000012
render ads
   0.000512
fetch current hosters
   0.000338
related datasets
   0.001761
Done