Abstract
In this paper, we propose a case-based reasoning scheme in which we extract domain knowledge (in the form of design patterns) from a genetic algorithm used to optimize combinational logic circuits at the gate level. Such information is used in two ways: first, we show how the selection pressure of the genetic algorithm is biased by Boolean simplification rules that are normally adopted by human designers, including some which are not completely straightforward. Secondly, we reuse some of these design patterns extracted from the evolutionary process to reduce convergence times of a genetic algorithm using previously found solutions as cases to solve similar problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
