Modern solvers for hard computational problems often expose parameters that permit customization for high performance on specific instance types. Since it is tedious and time-consuming to manually optimize such highly parameterized algorithms, recent work in the AI literature has developed automated approaches for this algorithm configu
Algorithm designers are regularly faced with the tedious task of finding suitable default values fo...
The performance of an algorithm often critically depends on its parameter configuration. While a var...
Computationally challenging problems arise in the context of many applications, and the ability to s...
Modern solvers for hard computational problems often expose parameters that permit customization for...
The task of algorithm selection involves choosing an algorithm from a set of algorithms on a per-ins...
Schede EA, Brandt J, Tornede A, et al. A Survey of Methods for Automated Algorithm Configuration. Jo...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
Technology has a major role in today’s world. The development and massive access to information tech...
Configuring algorithms automatically to achieve high performance is becom-ing increasingly relevant ...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
The design and configuration of optimization algorithms for computationally hard problems is a time-...
The performance of many hard combinatorial problem solvers depends strongly on their parameter setti...
Algorithm selection (AS) techniques – which involve choosing from a set of algorithms the one expect...
We study the algorithm configuration (AC) problem, in which one seeks to find an optimal parameter c...
A meta-algorithmic procedure is a computer procedure that operates upon another algorithm and its as...
Algorithm designers are regularly faced with the tedious task of finding suitable default values fo...
The performance of an algorithm often critically depends on its parameter configuration. While a var...
Computationally challenging problems arise in the context of many applications, and the ability to s...
Modern solvers for hard computational problems often expose parameters that permit customization for...
The task of algorithm selection involves choosing an algorithm from a set of algorithms on a per-ins...
Schede EA, Brandt J, Tornede A, et al. A Survey of Methods for Automated Algorithm Configuration. Jo...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
Technology has a major role in today’s world. The development and massive access to information tech...
Configuring algorithms automatically to achieve high performance is becom-ing increasingly relevant ...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
The design and configuration of optimization algorithms for computationally hard problems is a time-...
The performance of many hard combinatorial problem solvers depends strongly on their parameter setti...
Algorithm selection (AS) techniques – which involve choosing from a set of algorithms the one expect...
We study the algorithm configuration (AC) problem, in which one seeks to find an optimal parameter c...
A meta-algorithmic procedure is a computer procedure that operates upon another algorithm and its as...
Algorithm designers are regularly faced with the tedious task of finding suitable default values fo...
The performance of an algorithm often critically depends on its parameter configuration. While a var...
Computationally challenging problems arise in the context of many applications, and the ability to s...
Add to ORKG