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}}
Send FeedbackStart 0.000008 DB Connect 0.000529 Lookup hash in DB 0.000893 Get torrent details 0.000777 Get torrent details, finished 0.000739 Get authors 0.000005 Select authors 0.012177 Parse bibtex 0.000162 Write header 0.000839 get stars 0.000601 collections tab 0.042948 home tab 0.000699 render right panel 0.000033 render ads 0.000088 fetch current hosters 0.009748 Done
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning.pdf