Sciweavers

29 search results - page 2 / 6
» Optimizing exact genetic linkage computations
Sort
View
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 1 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
14 years 1 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
BMCBI
2008
153views more  BMCBI 2008»
13 years 7 months ago
AWclust: point-and-click software for non-parametric population structure analysis
Background: Population structure analysis is important to genetic association studies and evolutionary investigations. Parametric approaches, e.g. STRUCTURE and L-POP, usually ass...
Xiaoyi Gao, Joshua D. Starmer
IWANN
2001
Springer
13 years 12 months ago
A New Approach to Evolutionary Computation: Segregative Genetic Algorithms (SEGA)
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
Michael Affenzeller
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
14 years 1 months ago
On the complexity of hierarchical problem solving
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens