.png){kind=icon}
返回
IMPLICIT PARALLELISM IN GENETIC ALGORITHMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0004-3702(93)90071-I.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
.png){kind=icon}
