This is a cached version of the website. Click here to view the live site.
Enjoying our site? Please disable your ad blocker to support us!
Toggle navigation
Academic Torrents
Browse
Datasets
Papers
Courses
Collections
Upload
About
Support
Login
Search
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
Ronen I. Brafman
and
Moshe Tennenholtz
Home
Technical
4/0
Comments
0
Collections
0
I accept the terms
Download 101.23kB
No comments yet
Add a comment
Compute download stats
Related Torrents
A New Algorithm for Estimating the Effective Dimension-Reduction Subspace
292.05kB · 5 seeds
A Divisive Information-Theoretic Feature Clustering Algorithm for Text Classification (Kernel Mac...
301.96kB · 4 seeds
Search for Additive Nonlinear Time Series Causal Models
784.42kB · 3 seeds
Finite-Time Bounds for Fitted Value Iteration
54.73kB · 3 seeds
Linear-Time Computation of Similarity Measures for Sequential Data
533.68kB · 4 seeds
Send Feedback
No comments yet
Add a comment