Sciweavers

8125 search results - page 122 / 1625
» Parallelism and evolutionary algorithms
Sort
View
CEC
2005
IEEE
15 years 5 months ago
A new approach to dynamics analysis of genetic algorithms without selection
Abstract- Theoretical analysis of the dynamics of evolutionary algorithms is believed to be very important to understand the search behavior of evolutionary algorithms and to devel...
Tatsuya Okabe, Yaochu Jin, Bernhard Sendhoff
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 8 months ago
Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
José Antonio Martin H.
HAIS
2009
Springer
15 years 6 months ago
A First Study on the Use of Coevolutionary Algorithms for Instance and Feature Selection
Abstract. Cooperative Coevolution is a technique in the area of Evolutionary Computation. It has been applied to many combinatorial problems with great success. This contribution p...
Joaquín Derrac, Salvador García, Fra...
124
Voted
EVOW
2008
Springer
15 years 5 months ago
Analogue Circuit Control through Gene Expression
Abstract. Software configurable analogue arrays offer an intriguing platform for automated design by evolutionary algorithms. Like previous evolvable hardware experiments, these pl...
Kester Clegg, Susan Stepney
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 4 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella