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 …

Algorithm selection refers to the task of automatically selecting the most suitable algorithm
for solving an instance of a computational problem from a set of candidate algorithms. Here …

The notion of bounded rationality originated from the insight that perfectly rational behavior
cannot be realized by agents with limited cognitive or computational resources. Research on …

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 …