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.000005
DB Connect
   0.000950
Lookup hash in DB
   0.000840
Get torrent details
   0.000553
Get torrent details, finished
   0.000607
Get authors
   0.000005
Select authors
   0.000758
Parse bibtex
   0.000433
Write header
   0.001431
get stars
   0.000406
home tab
   0.000365
render right panel
   0.000009
render ads
   0.000044
fetch current hosters
   0.000635
Done