.png){kind=icon}
返回
Selection intensity in cellular evolutionary algorithms for regular lattices
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2005.850298.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present quantitative models for the selection pressure of cellular evolutionary algorithms on regular one- and two-dimensional (2-D) lattices. We derive models based on probabilistic difference equations for synchronous and several asynchronous cell update policies. The models are validated using two customary selection methods: binary tournament and linear ranking. Theoretical results are in agreement with experimental values, showing that the selection intensity can be controlled by using different update methods. It is also seen that the usual logistic approximation breaks down for low-dimensional lattices and should be replaced by a polynomial approximation. The dependence of the models on the neighborhood radius is studied for both topologies. We also derive results for 2-D lattices with variable grid axes ratio.
Keyword:
asynchronous dynamics
cellular evolutionary algorithms (cEAs)
regular lattices
selection intensity
synchronous dynamics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
暂无机构信息
引用论文
Natural killer cell activity during the course of disease in patients with Hodgkin's disease.png)
Cancer
OAAI
CancerIF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容