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.000019
DB Connect
   0.000408
Lookup hash in DB
   0.001037
Get torrent details
   0.000977
Get torrent details, finished
   0.000771
Get authors
   0.000004
Select authors
   0.000413
Parse bibtex
   0.000141
Write header
   0.000498
get stars
   0.000936
home tab
   0.001377
render right panel
   0.000033
render ads
   0.000308
fetch current hosters
   0.001050
Done