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}}
Compute download stats
Related Torrents
Report
Send Feedback Start
   0.000005
DB Connect
   0.000416
Lookup hash in DB
   0.000372
Get torrent details
   0.000143
Get torrent details, finished
   0.000219
Get authors
   0.000001
Select authors
   0.001786
Parse bibtex
   0.000028
Write header
   0.000203
get stars
   0.000110
home tab
   0.000123
render right panel
   0.000006
render ads
   0.000358
fetch current hosters
   0.000245
related datasets
   0.001164
Done