Sciweavers

5082 search results - page 316 / 1017
» Hierarchical Genetic Algorithms
Sort
View
FOGA
2011
14 years 8 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 10 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
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
15 years 10 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
TSMC
2002
137views more  TSMC 2002»
15 years 4 months ago
An evolutionary tabu search for cell image segmentation
Many problems in practically all fields of science, engineering and technology involve global optimization. It becomes more and more important to develop the efficient global opti...
Tianzi Jiang, Faguo Yang
TEC
2010
132views more  TEC 2010»
14 years 11 months ago
A Hybrid Evolutionary Approach to the Nurse Rostering Problem
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle t...
Ruibin Bai, Edmund K. Burke, Graham Kendall, Jingp...