Results 211 to 220 of about 229,968 (264)

Unbiasedness of estimation-of-distribution algorithms

Theoretical Computer Science, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tobias Friedrich 0001   +2 more
openaire   +1 more source

Space Complexity of Estimation of Distribution Algorithms

Evolutionary Computation, 2005
In this paper, we investigate the space complexity of the Estimation of Distribution Algorithms (EDAs), a class of sampling-based variants of the genetic algorithm. By analyzing the nature of EDAs, we identify criteria that characterize the space complexity of two typical implementation schemes of EDAs, the factorized distribution algorithm and ...
Yong Gao 0001, Joseph C. Culberson
openaire   +2 more sources

Estimating Distributions in Genetic Algorithms

2003
The canonical operators of genetic algorithms, i.e., mutation and crossover, have nondeterministic effects on the population.They use information from only one or two fit individuals and risk deforming the chromosomes of fit individuals and cause an interruption in the progression.
Onur Dikmen   +2 more
openaire   +1 more source

Subspace estimation of distribution algorithms: To perturb part of all variables in estimation of distribution algorithms

Applied Soft Computing, 2011
Abstract: In the traditional estimation of distribution algorithms (EDAs), all the variables of candidate individuals are perturbed through sampling from a probability distribution of promising individuals. However, it may be unnecessary for the EDAs to perturb all variables of candidate individuals at each generation.
Helong Li, Yi Hong 0002, Sam Kwong
openaire   +1 more source

Drift and Scaling in Estimation of Distribution Algorithms

Evolutionary Computation, 2005
This paper considers a phenomenon in Estimation of Distribution Algorithms (EDA) analogous to drift in population genetic dynamics. Finite population sampling in selection results in fluctuations which get reinforced when the probability model is updated.
openaire   +2 more sources

Estimation of Distribution Algorithms with Kikuchi Approximations

Evolutionary Computation, 2005
The question of finding feasible ways for estimating probability distributions is one of the main challenges for Estimation of Distribution Algorithms (EDAs). To estimate the distribution of the selected solutions, EDAs use factorizations constructed according to graphical models. The class of factorizations that can be obtained from these probability
openaire   +2 more sources

On the limits of effectiveness in estimation of distribution algorithms

2011 IEEE Congress of Evolutionary Computation (CEC), 2011
Which problems a search algorithm can effectively solve is a fundamental issue that plays a key role in understanding and developing algorithms. In order to study the ability limit of estimation of distribution algorithms (EDAs), this paper experimentally tests three different EDA implementations on a sequence of additively decomposable functions (ADFs)
Carlos Echegoyen   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy