Show simple item record

dc.contributor.authorBrandejsky, Tomas
dc.date.accessioned2019-06-26T10:18:08Z
dc.date.available2019-06-26T10:18:08Z
dc.date.issued2017-06-01cs
dc.identifier.citationMendel. 2017 vol. 23, č. 1, s. 29-32. ISSN 1803-3814cs
dc.identifier.issn2571-3701
dc.identifier.issn1803-3814
dc.identifier.urihttp://hdl.handle.net/11012/179195
dc.description.abstractThe paper discusses the influence of function set structure onto efficiency of GPA (Genetic Programming Algorithms), and hierarchical algorithms like GPA-ES (GPA with Evolutionary Strategy to separate parameter optimization) algorithm efficiency. On the foreword, the discussed GPA algorithm is described. Then there is depicted function set and common requirements to its structure. On the end of this contribution, the test examples and environment as well as results of measurement of influence of superfluous functions presence in the used function set is discussed.en
dc.formattextcs
dc.format.extent29-32cs
dc.format.mimetypeapplication/pdfen
dc.language.isoencs
dc.publisherInstitute of Automation and Computer Science, Brno University of Technologycs
dc.relation.ispartofMendelcs
dc.relation.urihttps://mendel-journal.org/index.php/mendel/article/view/48cs
dc.subjectGenetic Programming Algorithmen
dc.subjectEfficiencyen
dc.subjectFunction seten
dc.subjectFunction set structureen
dc.subjectInapplicable functionsen
dc.subjectmutually replaceable functionsen
dc.titleFunction Set Structure Influence onto GPA Efficiencyen
eprints.affiliatedInstitution.facultyFakulta strojního inženýrstvícs
dc.coverage.issue1cs
dc.coverage.volume23cs
dc.identifier.doi10.13164/mendel.2017.1.029en
dc.rights.accessopenAccessen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record