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}}

Hosted by users:
gravatar.com icon for user domshke
Report
Send Feedback Start
   0.000006
DB Connect
   0.000442
Lookup hash in DB
   0.000373
Get torrent details
   0.000109
Get torrent details, finished
   0.000210
Get authors
   0.000001
Select authors
   0.002322
Parse bibtex
   0.000038
Write header
   0.000219
get stars
   0.000118
home tab
   0.000109
render right panel
   0.000010
render ads
   0.000419
fetch current hosters
   0.001216
Done