Sciweavers

17760 search results - page 340 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ICML
2004
IEEE
16 years 7 months ago
Surrogate maximization/minimization algorithms for AdaBoost and the logistic regression model
Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. There are...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
ALT
2004
Springer
16 years 3 months ago
New Revision Algorithms
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
Judy Goldsmith, Robert H. Sloan, Balázs Sz&...
174
Voted
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
16 years 1 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
16 years 1 months ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
16 years 11 days ago
A comparison of evolutionary algorithms for system-level diagnosis
The size and complexity of systems based on multiple processing units demand techniques for the automatic diagnosis of their state. System-level diagnosis consists in determining ...
Bogdan Tomoyuki Nassu, Elias Procópio Duart...