Sophisticated empirical methods based upon automated experimental analysis techniques drive the development of high-performance solvers for an increasing range of problems from industry and academia. However, tools implementing these methods are often difficult to develop and to use. This thesis describes work towards addressing this issue. First, we develop a formal description of meta-algorithmic problems, and use it as the basis for a framework supporting the development and application of a broad class of automated algorithm analysis and design techniques. Second, we describe the High-performance Algorithm Laboratory (HAL), an extensible software implementation of this framework that provides developers and users of automated empirical ...
Automated algorithm configuration has been proven to be an effective approach for achieving improved...
The past few years have seen an enormous progress in the performance of Boolean satisfiability (SAT)...
The last 30 years have seen enormous progress in the design of algorithms, but comparatively little ...
In practical applications, some important classes of problems are NP-complete. Although no worst-cas...
This report documents the program and the outcomes of Dagstuhl Seminar 22411 "Theory and Practice of...
In competitive programming, one has to use knowledge in algorithms and data structures to find solut...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
The development of algorithms solving computationally hard optimisation problems has a long history....
In this talk, I will introduce computer-aided algorithm design and discuss its main ingredients: des...
Meta-heuristic algorithm development through a novel intergrated problem solving environment for so...
Design and Analysis of Algorithms is a field of computer science that focuses on the study of algori...
A meta-algorithmic procedure is a computer procedure that operates upon another algorithm and its as...
Metaheuristics are gradient-free and problem-independent search methods. They have gained huge succe...
The development of algorithms solving computationally hard optimisation problems has a long history....
The goal of competitive programming is being able to find abstract solutions for some given algorith...
Automated algorithm configuration has been proven to be an effective approach for achieving improved...
The past few years have seen an enormous progress in the performance of Boolean satisfiability (SAT)...
The last 30 years have seen enormous progress in the design of algorithms, but comparatively little ...
In practical applications, some important classes of problems are NP-complete. Although no worst-cas...
This report documents the program and the outcomes of Dagstuhl Seminar 22411 "Theory and Practice of...
In competitive programming, one has to use knowledge in algorithms and data structures to find solut...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
The development of algorithms solving computationally hard optimisation problems has a long history....
In this talk, I will introduce computer-aided algorithm design and discuss its main ingredients: des...
Meta-heuristic algorithm development through a novel intergrated problem solving environment for so...
Design and Analysis of Algorithms is a field of computer science that focuses on the study of algori...
A meta-algorithmic procedure is a computer procedure that operates upon another algorithm and its as...
Metaheuristics are gradient-free and problem-independent search methods. They have gained huge succe...
The development of algorithms solving computationally hard optimisation problems has a long history....
The goal of competitive programming is being able to find abstract solutions for some given algorith...
Automated algorithm configuration has been proven to be an effective approach for achieving improved...
The past few years have seen an enormous progress in the performance of Boolean satisfiability (SAT)...
The last 30 years have seen enormous progress in the design of algorithms, but comparatively little ...