Circuit Approximation Using Single- and Multi-Objective Cartesian GP

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F15%3APU116939" target="_blank" >RIV/00216305:26230/15:PU116939 - isvavai.cz</a>
Result on the web
<a href="http://www.fit.vutbr.cz/research/pubs/all.php?id=10763" target="_blank" >http://www.fit.vutbr.cz/research/pubs/all.php?id=10763</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-16501-1_18" target="_blank" >10.1007/978-3-319-16501-1_18</a>

Result language
angličtina
Original language name
Circuit Approximation Using Single- and Multi-Objective Cartesian GP
Original language description
In this paper, the approximate circuit design problem is formulated as a multi-objective optimization problem in which the accuracy and power consumption are conflicting design objectives. We compare multi-objective and single-objective Cartesian genetic programming in the task of parallel adder and multiplier approximation. It is analyzed how the setting of the methods, formulating the problem as multi-objective or single-objective, and constraining the execution time can influence the quality of results. One of the conclusions is that the multi-objective approach is useful if the number of allowed evaluations is low. When more time is available, the single-objective approach becomes more efficient.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA14-04197S" target="_blank" >GA14-04197S: Advanced Methods for Evolutionary Design of Complex Digital Circuits</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)