Sciweavers

18306 search results - page 195 / 3662
» Algorithmics in Exponential Time
Sort
View
140
Voted
IJCAI
2001
15 years 3 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
JMLR
2010
119views more  JMLR 2010»
14 years 9 months ago
A Convergent Online Single Time Scale Actor Critic Algorithm
Actor-Critic based approaches were among the first to address reinforcement learning in a general setting. Recently, these algorithms have gained renewed interest due to their gen...
Dotan Di Castro, Ron Meir
ANTS
2008
Springer
67views Algorithms» more  ANTS 2008»
15 years 4 months ago
Running Time Predictions for Factoring Algorithms
Ernie Croot, Andrew Granville, Robin Pemantle, Pra...
102
Voted
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
15 years 3 months ago
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
Parinya Chalermsook, Jittat Fakcharoenphol, Danupo...