Sciweavers

2152 search results - page 13 / 431
» Backward-chaining evolutionary algorithms
Sort
View
CIMCA
2005
IEEE
15 years 3 months ago
A New Evolutionary Algorithm for Determining the Optimal Number of Clusters
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
Wei Lu, Issa Traoré
PPSN
1994
Springer
15 years 1 months ago
An Evolutionary Algorithm for Integer Programming
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
Günter Rudolph
AAAI
2006
14 years 11 months ago
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
Yang Yu, Zhi-Hua Zhou
CEC
2005
IEEE
15 years 3 months ago
Complexity transitions in evolutionary algorithms: evaluating the impact of the initial population
Abstract- This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity di...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
EMO
2005
Springer
110views Optimization» more  EMO 2005»
15 years 3 months ago
Parallelization of Multi-objective Evolutionary Algorithms Using Clustering Algorithms
Abstract. While Single-Objective Evolutionary Algorithms (EAs) parallelization schemes are both well established and easy to implement, this is not the case for Multi-Objective Evo...
Felix Streichert, Holger Ulmer, Andreas Zell