Sciweavers

844 search results - page 65 / 169
» Generalized crowding for genetic algorithms
Sort
View
CCE
2005
14 years 9 months ago
Use of parallel computers in rational design of redundant sensor networks
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
Carine Gerkens, Georges Heyen
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
15 years 4 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
GECCO
2004
Springer
112views Optimization» more  GECCO 2004»
15 years 3 months ago
Some Issues on the Implementation of Local Search in Evolutionary Multiobjective Optimization
This paper discusses the implementation of local search in evolutionary multiobjective optimization (EMO) algorithms for the design of a simple but powerful memetic EMO algorithm. ...
Hisao Ishibuchi, Kaname Narukawa
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 1 months ago
Characterizing the dynamics of symmetry breaking in genetic programming
This paper introduces a metric that measures symmetry in tree graphs, which allows for a statistical characterization of GP solutions by their architectural "shapes." A ...
Jason M. Daida
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
15 years 3 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