Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
IJCAI
/
Paper
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning.
Ronen I. Brafman
,
Moshe Tennenholtz
Venue
A*
IJCAI
Year
2001
Proceedings
IJCAI
DBLP record
conf/ijcai/BrafmanT01 ↗
Browse the full
IJCAI paper archive
.