Sciweavers

2407 search results - page 36 / 482
» The evolutionary forest algorithm
Sort
View
79
Voted
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
ESA
1998
Springer
154views Algorithms» more  ESA 1998»
15 years 1 months ago
A Functional Approach to External Graph Algorithms
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
James Abello, Adam L. Buchsbaum, Jeffery Westbrook
CEC
2008
IEEE
15 years 4 months ago
When to use bit-wise neutrality
—Representation techniques are important issues when designing successful evolutionary algorithms. Within this field the use of neutrality plays an important role. We examine th...
Tobias Friedrich, Frank Neumann
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