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.000012
DB Connect
   0.001187
Lookup hash in DB
   0.001489
Get torrent details
   0.000479
Get torrent details, finished
   0.001033
Get authors
   0.000036
Select authors
   0.000778
Parse bibtex
   0.000198
Write header
   0.000956
get stars
   0.000531
home tab
   0.000566
render right panel
   0.000115
render ads
   0.001613
fetch current hosters
   0.003042
Done