Sciweavers

980 search results - page 137 / 196
» Evolutionary organizational search
Sort
View
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 5 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 5 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
147views Optimization» more  GECCO 2004»
15 years 5 months ago
A Demonstration of Neural Programming Applied to Non-Markovian Problems
Genetic programming may be seen as a recent incarnation of a long-held goal in evolutionary computation: to develop actual computational devices through evolutionary search. Geneti...
Gabriel Catalin Balan, Sean Luke
CEC
2003
IEEE
15 years 5 months ago
Learning DFA: evolution versus evidence driven state merging
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
Simon M. Lucas, T. Jeff Reynolds
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
15 years 4 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria