Use of Time-Domain Simulations in Automatic Synthesis of Computational Circuits Using GP

Created by W.Langdon from gp-bibliography.bib Revision:1.7615

@InProceedings{Koza2:2000:GECCOlb,

• author = "William Mydlowec and John R. Koza",
• title = "Use of Time-Domain Simulations in Automatic Synthesis of Computational Circuits Using GP",
• pages = "187--197",
• booktitle = "Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference",
• year = "2000",
• editor = "Darrell Whitley",
• address = "Las Vegas, Nevada, USA",
• month = "8 " # jul,
• keywords = "genetic algorithms, genetic programming",
• URL = "http://www.genetic-programming.com/jkpdf/gecco2000computational.pdf",
• abstract = "Previously reported applications of genetic programming to the automatic synthesis of computational circuits have employed simulations based on DC sweeps. DC sweeps have the advantage of being considerably less time-consuming than time-domain simulations. However, this type of simulation does not necessarily lead to robust circuits that correctly perform the desired mathematical function over time. This paper addresses the problem of automatically synthesizing computational circuits using multiple time-domain simulations and presents results involving the synthesis of both the topology and sizing for a squaring, square root, and multiplier computational circuit and a lag circuit (from the field of control).",
• notes = "Part of \cite{whitley:2000:GECCOlb}",

}

Genetic Programming entries for William J Mydlowec John Koza

Citations