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.000004
DB Connect
   0.000553
Lookup hash in DB
   0.002998
Get torrent details
   0.000475
Get torrent details, finished
   0.000905
Get authors
   0.000003
Select authors
   0.014659
Parse bibtex
   0.000114
Write header
   0.000709
get stars
   0.000368
home tab
   0.000397
render right panel
   0.000008
render ads
   0.000053
fetch current hosters
   0.006923
Done