English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Cartesian Genetic Programming (CGP) is often applied to design combinational logic circuits. However, there is no consensus in the literature regarding the more appropriate objective function when it is desired to minimize the number of logic gates of the circuit. Thus, we analyze here two strategies: the minimization of the number of logic gates and the maximization of the number of wire gates. Additionally, a biased mutation strategy for CGP, which were previously presented and tested only to find a feasible solution, are extended in this paper for the subsequent optimization step. Several configurations were proposed and tested varying objective function and selection schemes. Computational experiments are conducted with some benchmark circuits to relatively compare the proposed methods, and the results obtained are better than those found by the other techniques considered here.

Biased Mutation and Tournament Selection Approaches for Designing Combinational Logic Circuits via Cartesian Genetic Programming