.png){kind=icon}
Return
IMPLICIT PARALLELISM IN GENETIC ALGORITHMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0004-3702(93)90071-I.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper is related to Holland's result on implicit parallelism. Roughly speaking, Holland showed a lower bound of the order of n3/c1 square-root l to the number of schemata usefully processed by the genetic algorithm in a population of n = c1 . 2l binary strings, with c1 a small integer. We analyze the case of a population of n = 2betal binary strings where beta is a positive parameter (Holland's result is related to the case beta = 1). In the main result, we state a lower bound on the expected number of processed schemata for all beta > 0; moreover, we prove that this bound is tight up to a constant for all beta greater-than-or-equal-to 1 and, in this case, we strengthen in probability the previous result.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave