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.000011
DB Connect
   0.001007
Lookup hash in DB
   0.001082
Get torrent details
   0.000461
Get torrent details, finished
   0.000595
Get authors
   0.000002
Select authors
   0.000435
Parse bibtex
   0.000074
Write header
   0.000458
get stars
   0.000386
home tab
   0.000292
render right panel
   0.000023
render ads
   0.000839
fetch current hosters
   0.000619
Done