Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICML
/
Paper
Model-based reinforcement learning with nearly tight exploration complexity bounds.
Istvan Szita
,
Csaba Szepesvri
Venue
A*
ICML
Year
2010
Proceedings
ICML
DBLP record
conf/icml/SzitaS10 ↗
Browse the full
ICML paper archive
.