288 search results - page 25 / 58 » Learning to Play Chess Using Temporal Differences |
188
click to vote
ISVC
2007
Springer
16 years 16 days ago
2007
Springer
We present a novel boosting algorithm where temporal consistency is addressed in a short-term way. Although temporal correlation of observed data may be an important cue for classi...
212
click to vote
NCA
2008
IEEE
15 years 6 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
178
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
189
click to vote
ECTEL
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. The goal of the APOSDLE (Advanced Process-Oriented SelfDirected Learning environment) project is to support work-integrated learning of knowledge workers. We argue that w...
180
click to vote
BIBE
2009
IEEE
15 years 9 months ago
2009
IEEE
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...