咨询与建议

限定检索结果

文献类型

  • 2 篇 期刊文献

馆藏范围

  • 2 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2 篇 工学
    • 2 篇 计算机科学与技术...

主题

  • 2 篇 metameric repres...
  • 2 篇 variable-length ...
  • 2 篇 evolutionary alg...

机构

  • 2 篇 michigan state u...

作者

  • 2 篇 averill ron
  • 2 篇 deb kalyanmoy
  • 2 篇 goodman erik
  • 2 篇 ryerkerk matt

语言

  • 2 篇 英文
检索条件"主题词=Variable-length algorithms"
2 条 记 录,以下是1-10 订阅
排序:
A novel selection mechanism for evolutionary algorithms with metameric variable-length representations
收藏 引用
SOFT COMPUTING 2020年 第21期24卷 16439-16452页
作者: Ryerkerk, Matt Averill, Ron Deb, Kalyanmoy Goodman, Erik Michigan State Univ E Lansing MI 48824 USA
Metameric problems are variable-length optimization problems whose representations take on an at least partially segmented structure. This is referred to as a metameric representation. Frequently, each of these segmen... 详细信息
来源: 评论
A survey of evolutionary algorithms using metameric representations
收藏 引用
GENETIC PROGRAMMING AND EVOLVABLE MACHINES 2019年 第4期20卷 441-478页
作者: Ryerkerk, Matt Averill, Ron Deb, Kalyanmoy Goodman, Erik Michigan State Univ E Lansing MI 48824 USA
Evolutionary algorithms have been used to solve a number of variable-length problems, many of which share a common representation. A set of design variables is repeatedly defined, giving the genome a segmented structu... 详细信息
来源: 评论