GECCO
2006
Springer
14 years 3 months ago
2006
Springer
The field of Differential Evolution (DE) has demonstrated important advantages in single objective optimization. To date, no previous research has explored how the unique characte...
GECCO
2006
Springer
14 years 3 months ago
2006
Springer
This paper presents four rotatable multi-objective test problems that are designed for testing EMO (Evolutionary Multiobjective Optimization) algorithms on their ability in dealin...
GECCO
2006
Springer
14 years 3 months ago
2006
Springer
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...
GECCO
2006
Springer
14 years 3 months ago
2006
Springer
First, the covariance matrix adaptation (CMA) with rankone update is introduced into the (1+1)-evolution strategy. An improved implementation of the 1/5-th success rule is propose...
GECCO
2006
Springer
14 years 3 months ago
2006
Springer
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
GECCO
2006
Springer
14 years 3 months ago
2006
Springer
Coevolution has often been based on averaged outcomes, resulting in unstable evaluation. Several theoretical approaches have used archives to provide stable evaluation. However, t...
GECCO
2006
Springer
14 years 3 months ago
2006
Springer
Previous research has shown that evolutionary systems not only try to develop solutions that satisfy a fitness requirement, but indirectly attempt to develop genetically robust so...
GECCO
2006
Springer
14 years 3 months ago
2006
Springer
GECCO
2006
Springer
14 years 3 months ago
2006
Springer
In this paper, a genetic algorithm (GA) is used to design faulttolerant analog controllers for a piezoelectric micro-robot. Firstorder and second-order functions are developed to ...
GECCO
2006
Springer
14 years 3 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...