1641 search results - page 24 / 329 » Termination Analysis with Algorithmic Learning |
148
click to vote
PRICAI
2000
Springer
15 years 6 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
101
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
149
click to vote
NEUROSCIENCE
2001
Springer
15 years 7 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
112
Voted
IJCNN
2006
IEEE
15 years 8 months ago
2006
IEEE
— It is difficult to map many existing learning algorithms onto biological networks because the former require a separate learning network. The computational basis of biological...
121
Voted
ECML
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper, we investigate the properties of commonly used prepruning heuristics for rule learning by visualizing them in PN-space. PN-space is a variant of ROC-space,...