Sciweavers

3569 search results - page 469 / 714
» On the Evolution of Evolutionary Algorithms
Sort
View
PR
2007
116views more  PR 2007»
15 years 5 months ago
GAPS: A clustering method using a new point symmetry-based distance measure
In this paper, an evolutionary clustering technique is described that uses a new point symmetry-based distance measure. The algorithm is therefore able to detect both convex and n...
Sanghamitra Bandyopadhyay, Sriparna Saha
CEC
2010
IEEE
15 years 1 months ago
Multi-objective robust static mapping of independent tasks on grids
We study the problem of efficiently allocating incoming independent tasks onto the resources of a Grid system. Typically, it is assumed that the estimated time to compute each task...
Bernabé Dorronsoro Díaz, Pascal Bouv...
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
14 years 9 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
BMCBI
2008
111views more  BMCBI 2008»
15 years 6 months ago
GENOMEPOP: A program to simulate genomes in populations
Background: There are several situations in population biology research where simulating DNA sequences is useful. Simulation of biological populations under different evolutionary...
Antonio Carvajal-Rodríguez
EOR
2006
135views more  EOR 2006»
15 years 6 months ago
Principles of scatter search
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
Rafael Martí, Manuel Laguna, Fred Glover