GECCO
2009
Springer
14 years 6 months ago
2009
Springer
This paper presents an approach to automatically optimize the retrieval quality of ranking functions. Taking a Swarm Intelligence perspective, we present a novel method, SwarmRank...
GECCO
2009
Springer
14 years 6 months ago
2009
Springer
Multi-material 3D-printing technologies permit the freeform fabrication of complex spatial arrangements of materials in arbitrary geometries. This technology has opened the door t...
GECCO
2009
Springer
14 years 6 months ago
2009
Springer
Most of the software developed in the world follows the object-oriented (OO) paradigm. However, the existing work on evolutionary testing is mainly targeted to procedural language...
GECCO
2009
Springer
14 years 6 months ago
2009
Springer
Bloat is a common problem with Evolutionary Algorithms (EAs) that use variable length representation. By creating unnecessarily large individuals it results in longer EA runtimes ...
37
Voted
GECCO
2009
Springer
14 years 6 months ago
2009
Springer
Problems such as the design of distributed controllers are characterized by modularity and symmetry. However, the symmetries useful for solving them are often difficult to determ...
GECCO
2009
Springer
14 years 6 months ago
2009
Springer
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...
GECCO
2009
Springer
14 years 6 months ago
2009
Springer
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
GECCO
2009
Springer
14 years 6 months ago
2009
Springer
GECCO
2009
Springer
14 years 6 months ago
2009
Springer
In this paper, we evaluate the performance of ten well-known evolutionary and non-evolutionary rule learning algorithms. The comparative study is performed on a real-world classi...
GECCO
2009
Springer
14 years 6 months ago
2009
Springer
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...