.png){kind=icon}
返回
Towards generalized expression for schemata count
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2010.07.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The main goal of research reported in this paper is to propose a new technique for schemata count of Genetic Algorithms. Till recently, no methods existed for counting the schemata except the manual one that was obviously cursed by the tedium involved. A substantially generalized expression has been developed that directly computes the number of unique (different) schemata in a population, using breakup of similarity bits for non-repeated strings. (C) 2010 Elsevier B. V. All rights reserved.
Keyword:
Breakup of similarity bits
Chromosomes
Genetic Algorithm (GA)
Schemata
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
.png){kind=icon}
