Sciweavers

288 search results - page 25 / 58
» Learning to Play Chess Using Temporal Differences
Sort
View
ISVC
2007
Springer
15 years 8 months ago
Boosting with Temporal Consistent Learners: An Application to Human Activity Recognition
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...
Pedro Canotilho Ribeiro, Plinio Moreno, José...
NCA
2008
IEEE
15 years 2 months ago
Neurodynamic programming: a case study of the traveling salesman problem
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...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
ECAI
2006
Springer
15 years 6 months ago
Least Squares SVM for Least Squares TD Learning
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 ...
Tobias Jung, Daniel Polani
ECTEL
2007
Springer
15 years 8 months ago
Scruffy Technologies to Enable (Work-integrated) Learning
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...
Stefanie N. Lindstaedt, Peter Scheir, Armin Ulbric...
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
15 years 5 months ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—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...
Zong-Xian Yin