Searching for "R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
by Ronen I. Brafman, Moshe Tennenholtz, Pack Kaelbling — 2001
… R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal…
Cited by 97 (7 self) – Add To MetaCart

Journal of Machine Learning Research 3 (2002) 213-231 Submitted 11/01; Published 10/02 R-max -- A
by Near-Optimal Reinforcement Learning, Ronen I. Brafman, Moshe Tennenholtz, Dale Schuurmans — 2002 — Journal of Machine Learning Research
… General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning Ronen I. Brafman brafman…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB