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.000017
DB Connect
   0.001596
Lookup hash in DB
   0.001449
Get torrent details
   0.000463
Get torrent details, finished
   0.000809
Get authors
   0.000003
Select authors
   0.000967
Parse bibtex
   0.000105
Write header
   0.000695
get stars
   0.000395
home tab
   0.000496
render right panel
   0.000034
render ads
   0.001406
fetch current hosters
   0.001050
Done