A genetic programming system is created. A first fitness function f1 is used to evolve a program that implements a first feature. Then the fitness function is switched to a second function f2, which is used to evolve a program that implements a second feature while still maintaining the first feature. The median number of generations G1 and G2 needed to evolve programs that work as defined by f1 and f2 are measured. The behavior of G1 and G2 are observed as the difficulty of the problem is increased.
In these systems, the density D1 of programs that work (for fitness function f1) is measured in the general population of programs. The relationship G1~1/sqrt(D1) is observed to approximately hold. Also, the density D2 of programs that work (for fitness function f2) is measured in the general population of programs. The relationship G2~1/sqrt(D2) is observed to approximately hold.
Monotone but Exciting: On Evolving Monotone Boolean Functions with High Nonlinearity
University of Paris 8(巴黎第八大学);University of Bergen(卑尔根大学);Faculty of Electrical Engineering and Computing, University of Zagreb(萨格勒布大学电气工程和计算学院);Semantics, Cybersecurity and Services Group, University of Twente(特文特大学语义、网络安全与服务组);Digital Security Group, Radboud University(拉波德国立大学数字安全组)
NegaBent, No Regrets: Evolving Spectrally Flat Boolean Functions
University of Paris 8(巴黎第八大学);University of Bergen(卑尔根大学);Faculty of Electrical Engineering and Computing, University of Zagreb(萨格勒布大学电气工程和计算学院);University of Twente(特温特大学);Radboud University(拉德堡德大学)
Simulating Human Grandmasters: Evolution and Coevolution of Evaluation Functions
Bar-Ilan University(巴伊兰大学);Tilburg University(蒂尔堡大学);Gonda Brain Research Center at Bar-Ilan University(巴伊兰大学贡达脑科学研究中心);Center for Automation Research, University of Maryland(马里兰大学自动化研究中心)