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.pdf101.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.000493
Lookup hash in DB
   0.000653
Get torrent details
   0.000742
Get torrent details, finished
   0.000595
Get authors
   0.000005
Select authors
   0.000447
Parse bibtex
   0.000104
Write header
   0.000601
get stars
   0.000471
home tab
   0.000390
render right panel
   0.000010
render ads
   0.000062
fetch current hosters
   0.000632
Done