This chapter describes how the ASP entities discussed in section 2.1.4 (p. 32) can be recorded and stored, i.e., it covers the parts of the simulation algorithm selection framework that are highlighted in figure 5.1. Storing performance data in some common, readily accessible format is one of the major premises for reproducible and comparable performance results. Gent et al., for example, advise researchers to store all their published data for later re-evaluation [101]. The advantages of this approach become apparent in the work of Gagliolo and Schmidhuber [96], who re-use publicly available performance data published by Leyton-Brown et. al. [204] to test a new method for algorithm selection. In a similar vein, Adve et al. state that their performance modeling and prediction tool POEMS (see sec. 3.3.2, p. 112) “[…] could not be built without a database as a searchable repository for a wide spectrum of model and performance data” [3, p. 1035].


Performance Data Problem Instance Algorithm Selection Selection Tree Simulation Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH 2012

Authors and Affiliations

  • Roland Ewald

There are no affiliations available

Personalised recommendations