is this website about?
| target algorithms
|April 20, 2010
version of this website
What is this website about?
Informally speaking, the automated algorithm
problem can be
stated as follows: given a parameterized target algorithm A, a set of
instances P, and a cost metric c, find parameter settings of A
that minimize c on P. In practice, we split the benchmark instances
into training and test
sets (to saveguard against over-tuning for the training instances) and
specify a maximal cutoff time (a so-called captime)
after which each
so-far-unsuccessful run of the target algorithms is terminated.
We refer to procedures for solving the AAC problem as algorithm
On this website, we provide the
building blocks for a collection of
AAC problem instances that can be used to benchmark algorithm
procedures. The main building blocks for which data is required are (1)
target algorithms (including a specification of their
as well as wrappers to call them using a unified interface),
(2) benchmark instances of the type of problem the target algorithms
We also provide links to
several algorithm configuration procedures.
Target Algorithms and
Please send any questions,
concerns or comments to Frank