Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/108014
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDoerr, B.en
dc.contributor.authorJohannsen, D.en
dc.contributor.authorKötzing, T.en
dc.contributor.authorLehre, P.en
dc.contributor.authorWagner, M.en
dc.contributor.authorWinzen, C.en
dc.date.issued2011en
dc.identifier.citationProceedings of the 11th Workshop Proceedings on Foundations of Genetic Algorithms, 2011 / pp.163-172en
dc.identifier.isbn9781450306331en
dc.identifier.urihttp://hdl.handle.net/2440/108014-
dc.description.abstractWe extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-box model by considering higher arity variation operators. In particular, we show that already for binary operators the black-box complexity of LeadingOnes drops from Θ(n2) for unary operators to O(n log n). For OneMax, the (n log n) unary black-box complexity drops to O(n) in the binary case. For k-ary operators, k ≤ n, the OneMax-complexity further decreases to O(n⁄ log k).en
dc.description.statementofresponsibilityBenjamin Doerr Daniel Johannsen Timo Kötzing Per Kristian Lehre Markus Wagner Timo Kötzing Carola Winzenen
dc.language.isoenen
dc.publisherACM Pressen
dc.relation.ispartofseriesFOGA ’11en
dc.rightsCopyright 2011 ACMen
dc.source.urihttp://doi.acm.org/10.1145/1967654.1967669en
dc.subjectBlack-box complexity; runtime analysis; pseudo-Boolean optimization; theoryen
dc.titleFaster black-box algorithms through higher arity operatorsen
dc.typeConference paperen
dc.identifier.rmid0030059120en
dc.contributor.conference11th workshop proceedings on Foundations of genetic algorithms (FOGA) (05 Jan 2011 - 09 Jan 2011 : Schwarzenberg, Austria)en
dc.identifier.doi10.1145/1967654.1967669en
dc.identifier.pubid196412-
pubs.library.collectionComputer Science publicationsen
pubs.library.teamDS07en
pubs.verification-statusVerifieden
pubs.publication-statusPublisheden
dc.identifier.orcidWagner, M. [0000-0002-3124-0061]en
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_108014.pdfRestricted Access612.24 kBAdobe PDFView/Open


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