Sciweavers

6943 search results - page 46 / 1389
» Representations for evolutionary algorithms
Sort
View
PPSN
2010
Springer
14 years 8 months ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 3 months ago
Multi-chromosomal genetic programming
This paper introduces an evolutionary algorithm which uses multiple chromosomes to evolve solutions to a symbolic regression problem. Inspiration for this algorithm is provided by...
Rachel Cavill, Stephen L. Smith, Andrew M. Tyrrell
PPSN
2004
Springer
15 years 3 months ago
A Primer on the Evolution of Equivalence Classes of Bayesian-Network Structures
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...
Jorge Muruzábal, Carlos Cotta
ICES
1998
Springer
78views Hardware» more  ICES 1998»
15 years 1 months ago
Intrinsic Circuit Evolution Using Programmable Analogue Arrays
The basic properties of programmable analogue arrays are described and the problem of quantifying the fitness of an analogue circuit is discussed. A set of blocks appropriate for u...
Stuart J. Flockton, Kevin Sheehan
BMCBI
2008
111views more  BMCBI 2008»
14 years 9 months ago
A perl package and an alignment tool for phylogenetic networks
Background: Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of evolutionary events acting at the population level, like recombin...
Gabriel Cardona, Francesc Rosselló, Gabriel...