The problem of selecting an algorithm that appears most suitable for a specific instance of
an algorithmic problem class, such as the Boolean satisfiability problem, is called instance …

It is well known that different algorithms perform differently well on an instance of an
algorithmic problem, motivating algorithm selection (AS): Given an instance of an algorithmic …

In online algorithm selection (OAS), instances of an algorithmic problem class are presented
to an agent one after another, and the agent has to quickly select a presumably best …

The problem of selecting an algorithm that appears most suitable for a specific instance of
an algorithmic problem class, such as the Boolean satisfiability problem, is called instance …

Algorithm selection and generation techniques are two methods that can be used to exploit
the performance complementarity of different algorithms when applied to large diverse sets …

There exists a plethora of algorithms for most computationally hard problems, which all have
their strengths and weaknesses on different instances of said problems. Correspondingly …

Subproject B2 “Configuration and Evaluation” deals with methods and algorithms for the
configuration and evaluation of software services in the OTF Computing scenario. During the …