Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mersmann, Olaf | - |
dc.contributor.author | Preuss, Mike | - |
dc.contributor.author | Trautmann, Heike | - |
dc.date.accessioned | 2010-05-03T14:21:50Z | - |
dc.date.available | 2010-05-03T14:21:50Z | - |
dc.date.issued | 2010-05-03T14:21:50Z | - |
dc.identifier.uri | http://hdl.handle.net/2003/27132 | - |
dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-12945 | - |
dc.description.abstract | We 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.iso | en | en |
dc.relation.ispartofseries | Discussion Paper / SFB 823;14/2010 | - |
dc.subject | Benchmark | en |
dc.subject | Optimization algorithm | en |
dc.subject | Raw data | en |
dc.subject.ddc | 310 | - |
dc.subject.ddc | 330 | - |
dc.subject.ddc | 620 | - |
dc.title | Benchmarking evolutionary algorithms: Towards exploratory landscape analysis | en |
dc.type | Text | de |
dc.type.publicationtype | report | de |
dcterms.accessRights | open access | - |
Appears in Collections: | Sonderforschungsbereich (SFB) 823 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
DP_1410_SFB823_Mersmann_Preuss_Trautmann.pdf | DNB | 226.02 kB | Adobe PDF | View/Open |
This item is protected by original copyright |
This item is protected by original copyright
rightsstatements.org