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.000010
DB Connect
   0.001061
Lookup hash in DB
   0.005179
Get torrent details
   0.002142
Get torrent details, finished
   0.000900
Get authors
   0.000001
Select authors
   0.008079
Parse bibtex
   0.000099
Write header
   0.000664
get stars
   0.006222
home tab
   0.002354
render right panel
   0.000061
render ads
   0.000879
fetch current hosters
   0.057897
Done