Sciweavers

3044 search results - page 517 / 609
» Linear logical approximations
Sort
View
ECAI
2006
Springer
15 years 7 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
ECCV
2006
Springer
15 years 7 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang
ECML
2006
Springer
15 years 7 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
112
Voted
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 7 months ago
Standard and averaging reinforcement learning in XCS
This paper investigates reinforcement learning (RL) in XCS. First, it formally shows that XCS implements a method of generalized RL based on linear approximators, in which the usu...
Pier Luca Lanzi, Daniele Loiacono
131
Voted
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 7 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay