检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学院合肥智能机械研究所,合肥230031 [2]合肥工业大学计算机与信息学院,合肥230009
出 处:《计算机科学》2002年第12期143-145,共3页Computer Science
基 金:国家"863"计划信息技术项目基金(编号863-306-ZD05-01-4)
摘 要:Schema theorems are descriptions of how the number (or the fraction) of members of the population be-longing to a schema varies over time in evolutionary computation. This paper gives full summarization of the advancesin Genetic Programming exact schema theorems in recent years ,mainly discusses the exact formulation for the expect-ed number of instances of a schema at the next generation in terms of microscopic and macroscopic quantities,then,the effects and the mechanisms of schema creation are clarified.Schema theorems are descriptions of how the number (or the fraction) of members of the population belonging to a schema varies over time in evolutionary computation. This paper gives full summarization of the advances in Genetic Programming exact schema theorems in recent years, mainly discusses the exact formulation for the expected number of instances of a schema at the next generation in terms of microscopic and macroscopic quantities. then, the effects and the mechanisms of schema creation are clarified.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.42