Visualising the Search Landscape of the Triangle Program

Visualising the Search Landscape of the Triangle Program
复制标题

可视化三角程序的搜索景观

DOI:
--
复制
发表时间:
2017
期刊:
European Conference on Genetic Programming
影响因子:
--
通讯作者:
G. Ochoa
G. Ochoa
中科院分区:
--
文献类型:
--
作者:
W. Langdon;Nadarajen Veerapen;G. Ochoa

文献摘要

被引文献

相似文献

软件工程基准的高阶突变分析(包括模式和局部最优网络)表明程序改进可能并不像通常假设的那样难以找到。 (1) 按位遗传构建块不具有欺骗性,并且可以导致所有全局最优。 (2) 有许多中性网络、高原和局部最优,但在大多数情况下,在人类编写的 C 源代码附近,存在爬山路线,包括中性移动到解决方案。
High order mutation analysis of a software engineering benchmark, including schema and local optima networks, suggests program improvements may not be as hard to find as is often assumed. (1) Bit-wise genetic building blocks are not deceptive and can lead to all global optima. (2) There are many neutral networks, plateaux and local optima, nevertheless in most cases near the human written C source code there are hill climbing routes including neutral moves to solutions.