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}}
Report
Send Feedback Start
   0.000007
DB Connect
   0.000538
Lookup hash in DB
   0.000874
Get torrent details
   0.000624
Get torrent details, finished
   0.000754
Get authors
   0.000006
Select authors
   0.000547
Parse bibtex
   0.000122
Write header
   0.000550
get stars
   0.000397
home tab
   0.000441
render right panel
   0.000012
render ads
   0.000047
fetch current hosters
   0.000679
Done