Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Routine Duplication of Post-2000 Patented Inventions by Means of Genetic Programming
| Book Series | Lecture Notes in Computer Science |
| Publisher | Springer Berlin / Heidelberg |
| ISSN | 0302-9743 (Print) 1611-3349 (Online) |
| Volume | Volume 2278/2002 |
| Book | Genetic Programming |
| DOI | 10.1007/3-540-45984-7 |
| Copyright | 2002 |
| ISBN | 978-3-540-43378-1 |
| DOI | 10.1007/3-540-45984-7_3 |
| Pages | 238-240 |
| Subject Collection | Computer Science |
| SpringerLink Date | Tuesday, January 01, 2002 |
| |
|
Routine Duplication of Post-2000 Patented Inventions by Means of Genetic Programming
Matthew J. Streeter9 , Martin A. Keane10 and John R. Koza11 
| (9) |
Genetic Programming Inc., Mountain View, California |
| (10) |
Econometrics Inc., Chicago, Illinois |
| (11) |
Stanford University, Stanford, California |
Abstract
Previous work has demonstrated that genetic programming can automatically create analog electrical circuits, controllers,
and other devices that duplicate the functionality and, in some cases, partially or completely duplicate the exact structure
of inventions that were patented between 1917 and 1962. This paper reports on a project in which we browsed patents of analog
circuits issued after January 1, 2000 on the premise that recently issued patents represent current research that is considered
to be of practical and scientific importance. The paper describes how we used genetic programming to automatically create
circuits that duplicate the functionality or structure of five post-2000 patented inventions. This work employed four new
techniques (motivated by the theory of genetic algorithms and genetic programming) that we believe increased the efficiency
of the runs. When an automated method duplicates a previously patented human-designed invention, it can be argued that the
automated method satisfies a Patent-Office-based variation of the Turing test.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|