Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/15720
DC FieldValueLanguage
dc.contributor.authorDautović, Stanišaen
dc.contributor.authorNovak L.en
dc.date.accessioned2020-03-03T15:01:04Z-
dc.date.available2020-03-03T15:01:04Z-
dc.date.issued2006-11-01en
dc.identifier.issn11092734en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/15720-
dc.description.abstractIn this paper, a novel single objective evolutionary algorithm (SOEA) for combinational circuit design is proposed. The approach uses Boolean function signatures (BFSs) to calculate fitness function (FF), and can be considered as a generalization of standard calculation of FF, which is based on Boolean Matching (BM). The performance of proposed algorithm is tested and verified on the representatives of 12 different classes of Boolean functions (BFs).en
dc.relation.ispartofWSEAS Transactions on Circuits and Systemsen
dc.titleEvolutionary design of combinational circuits using Boolean function signaturesen
dc.typeJournal/Magazine Articleen
dc.identifier.scopus2-s2.0-33751571627en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/33751571627en
dc.relation.lastpage1681en
dc.relation.firstpage1677en
dc.relation.issue11en
dc.relation.volume5en
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptFakultet tehničkih nauka, Departman za energetiku, elektroniku i telekomunikacije-
crisitem.author.parentorgFakultet tehničkih nauka-
Appears in Collections:FTN Publikacije/Publications
Show simple item record

Page view(s)

22
Last Week
13
Last month
0
checked on May 10, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.