Sciweavers

2191 search results - page 163 / 439
» Evolutionary testing of classes
Sort
View
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 9 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
15 years 9 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
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
15 years 9 months ago
Alternative Bloat Control Methods
Abstract. Bloat control is an important aspect of evolutionary computation methods, such as genetic programming, which must deal with genomes of arbitrary size. We introduce three ...
Liviu Panait, Sean Luke
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 8 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
15 years 8 months ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell