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.000003
DB Connect
   0.000382
Lookup hash in DB
   0.000998
Get torrent details
   0.000687
Get torrent details, finished
   0.000749
Get authors
   0.000003
Select authors
   0.000527
Parse bibtex
   0.000074
Write header
   0.000568
get stars
   0.000483
home tab
   0.000490
render right panel
   0.000008
render ads
   0.000034
fetch current hosters
   0.000752
Done