Sciweavers

700 search results - page 89 / 140
» Searching Transcriptional Modules Using Evolutionary Algorit...
Sort
View
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 1 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
EVOW
2007
Springer
15 years 3 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
BIRD
2008
Springer
113views Bioinformatics» more  BIRD 2008»
14 years 11 months ago
Matching Spatial Regions with Combinations of Interacting Gene Expression Patterns
The Edinburgh Mouse Atlas aims to capture in-situ gene expression patterns in a common spatial framework. In this study, we construct a grammar to define spatial regions by combina...
Jano I. van Hemert, Richard A. Baldock
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 3 months ago
EA models and population fixed-points versus mutation rates for functions of unitation
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
J. Neal Richter, John Paxton, Alden H. Wright
CEC
2010
IEEE
14 years 6 months ago
Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...
Rammohan Mallipeddi, Ponnuthurai Nagaratnam Sugant...