Sciweavers

17760 search results - page 180 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 10 months ago
An extended mutation concept for the local selection based differential evolution algorithm
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
Jani Rönkkönen, Jouni Lampinen
COMBINATORICA
2010
14 years 11 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
139
Voted
GECCO
2007
Springer
194views Optimization» more  GECCO 2007»
15 years 10 months ago
Hybrid coevolutionary algorithms vs. SVM algorithms
As a learning method support vector machine is regarded as one of the best classifiers with a strong mathematical foundation. On the other hand, evolutionary computational techniq...
Rui Li, Bir Bhanu, Krzysztof Krawiec
JMLR
2002
75views more  JMLR 2002»
15 years 3 months ago
Stability and Generalization
We define notions of stability for learning algorithms and show how to use these notions to derive generalization error bounds based on the empirical error and the leave-one-out e...
Olivier Bousquet, André Elisseeff
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
15 years 10 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...