Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/66760
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFriedrich, T.-
dc.contributor.authorNeumann, F.-
dc.date.issued2008-
dc.identifier.citationProceedings of the IEEE Congress on Evolutionary Computation, 2008 (IEEE World Congress on Computational Intelligence), 1-6 June, 2008, pp. 997-1003-
dc.identifier.isbn9781424418220-
dc.identifier.urihttp://hdl.handle.net/2440/66760-
dc.description.abstractRepresentation techniques are important issues when designing successful evolutionary algorithms. Within this field the use of neutrality plays an important role. We examine the use of bit-wise neutrality introduced by Poli and Lopez (2007) from a theoretical point of view and show that this mechanism only enhances mutation-based evolutionary algorithms if not the same number of genotypic bits for each phenotypic bit is used. Using different numbers of genotypic bits for the bits in the phenome we point out by rigorous runtime analyses that it may reduce the optimization time significantly.-
dc.description.statementofresponsibilityTobias Friedrich and Frank Neumann-
dc.language.isoen-
dc.publisherIEEE Press-
dc.relation.ispartofseriesIEEE Congress on Evolutionary Computation-
dc.rights© 2008 IEEE-
dc.source.urihttp://dx.doi.org/10.1109/cec.2008.4630918-
dc.titleWhen to use bit-wise neutrality-
dc.typeConference paper-
dc.contributor.conferenceIEEE Congress on Evolutionary Computation (2008 : Hong Kong)-
dc.identifier.doi10.1109/CEC.2008.4630918-
dc.publisher.placeLos Alamitos, California-
pubs.publication-statusPublished-
dc.identifier.orcidNeumann, F. [0000-0002-2721-3618]-
Appears in Collections:Aurora harvest 5
Computer Science publications

Files in This Item:
There are no files associated with this item.


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