首页 | 本学科首页   官方微博 | 高级检索  
     


Routine high-return human-competitive automated problem-solving by means of genetic programming
Authors:John R. Koza  Matthew J. Streeter
Affiliation:a Stanford University, Post Office Box K, Los Altos, CA 94023, United States
b Genetic Programming Inc., 990 Villa Street, Mountain View, California 94041, United States
c Econometrics Inc., 1300 North Lake Shore No. 22B, Chicago, Illionois, United States
Abstract:Genetic programming is a systematic method for getting computers to automatically solve problems. Genetic programming starts from a high-level statement of what needs to be done and automatically creates a computer program to solve the problem by means of a simulated evolutionary process. The paper demonstrates that genetic programming (1) now routinely delivers high-return human-competitive machine intelligence; (2) is an automated invention machine; (3) can automatically create a general solution to a problem in the form of a parameterized topology and (4) has delivered a progression of qualitatively more substantial results in synchrony with five approximately order-of-magnitude increases in the expenditure of computer time. These points are illustrated by a group of recent results involving the automatic synthesis of the topology and sizing of analog electrical circuits, the automatic synthesis of placement and routing of circuits, and the automatic synthesis of controllers as well as references to work involving the automatic synthesis of antennas, networks of chemical reactions (metabolic pathways), genetic networks, mathematical algorithms, and protein classifiers.
Keywords:Genetic programming   Evolutionary computation   Automated design   Automated invention   Patented inventions   Controllers   Analog circuits
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号