Implicit Parallelism in Genetic Algorithms

DMCA

Implicit Parallelism in Genetic Algorithms (1993)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Alberto Bertoni , Marco Dorigo

Citations:

14 - 3 self

BibTeX

@MISC{Bertoni93implicitparallelism,
    author = {Alberto Bertoni and Marco Dorigo},
    title = {Implicit Parallelism in Genetic Algorithms},
    year = {1993}
}

OpenURL

Abstract

This paper is related to Holland's result on implicit parallelism. Roughly speaking, Holland showed a lower bound of the order of n 3 c 1 l to the number of schemata usefully processed by the genetic algorithm in a population of n = c 1 × 2 l binary strings, with c 1 a small integer. We analyze the case of population of n = 2 bl binary strings where b is a positive parameter (Holland's result is related to the case b=1). In the main result, for all b>0 we state a lower bound on the expected number of processed schemata; moreover, we prove that this bound is tight up to a constant for all b³1 and, in this case, we strengthen in probability the previous result. _______________________________ * This paper has appeared in Artificial Intelligence (61) 2, 307--314. + Universitá Statale di Milano, Dip. di Scenze dell'Informazione, via Comelico 39, 20135 Milano, Italy. # International Computer Science Institute, Berkeley, CA 94704, and Progetto di Intelligenza Artificiale e R...

Keyphrases

genetic algorithm implicit parallelism binary string bl binary string small integer universit statale di milano roughly speaking processed schema main result di scenze dell expected number positive parameter international computer science institute previous result artificial intelligence intelligenza artificiale

DMCA