Full metadata record
DC FieldValueLanguage
dc.contributor.authorMersmann, Olaf-
dc.contributor.authorPreuss, Mike-
dc.contributor.authorTrautmann, Heike-
dc.date.accessioned2010-05-03T14:21:50Z-
dc.date.available2010-05-03T14:21:50Z-
dc.date.issued2010-05-03T14:21:50Z-
dc.identifier.urihttp://hdl.handle.net/2003/27132-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-12945-
dc.description.abstractWe present methods to answer to basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the ‘best’ one? and the second one: which algorithm should I use for my real world problem? Both are connected and neither is easy to answer. We present methods which can be used to analyse the raw data of a benchmark experiment and derive some insight regarding the answers to these questions. We employ the presented methods to analyse the BBOB’09 benchmark results and present some initial findings.en
dc.language.isoenen
dc.relation.ispartofseriesDiscussion Paper / SFB 823;14/2010-
dc.subjectBenchmarken
dc.subjectOptimization algorithmen
dc.subjectRaw dataen
dc.subject.ddc310-
dc.subject.ddc330-
dc.subject.ddc620-
dc.titleBenchmarking evolutionary algorithms: Towards exploratory landscape analysisen
dc.typeTextde
dc.type.publicationtypereportde
dcterms.accessRightsopen access-
Appears in Collections:Sonderforschungsbereich (SFB) 823

Files in This Item:
File Description SizeFormat 
DP_1410_SFB823_Mersmann_Preuss_Trautmann.pdfDNB226.02 kBAdobe PDFView/Open


This item is protected by original copyright



This item is protected by original copyright rightsstatements.org