3 search results - page 1 / 1 » A Study of Reinforcement Learning in the Continuous Case by ... |
ML
2000
ACM
13 years 7 months ago
2000
ACM
ML
2008
ACM
13 years 7 months ago
2008
ACM
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
COR
2008
13 years 7 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...