Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Hoos, T. Stützle (2004)
Stochastic Local Search: Foundations & Applications
G. Nemhauser, L. Wolsey, M. Fisher (1978)
An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 14
Xin-She Yang (2008)
Nature-Inspired Metaheuristic Algorithms
F. Hutter, H. Hoos, Kevin Leyton-Brown, T. Stützle (2014)
ParamILS: An Automatic Algorithm Configuration FrameworkJ. Artif. Intell. Res., 36
R. Karp (1972)
Reducibility Among Combinatorial Problems
S. Kirkpatrick, C. Gelatt, Mario Vecchi (1983)
Optimization by Simulated AnnealingScience, 220
(2003)
Constraints Processing. The Morgan Kaufmann Series in Artificial Intelligence
David Williamson, D. Shmoys (2011)
The Design of Approximation Algorithms
Pascal Hentenryck, L. Michel (2018)
Constraint-based local search
C. Gomes, B. Selman (2001)
Algorithm portfoliosArtif. Intell., 126
F. Glover (1986)
Future paths for integer programming and links to artificial intelligenceComput. Oper. Res., 13
L. Gaspero, Andrea Schaerf (2000)
EasyLocal + + : An object-oriented framework for flexible design of local search algorithms
Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Leslie Cáceres, M. Birattari, T. Stützle (2016)
The irace package: Iterated racing for automatic algorithm configurationOperations Research Perspectives, 3
Y. Malitsky, Meinolf Sellmann (2012)
Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation
L. Michel, Pascal Hentenryck (1997)
Localizer: A Modeling Language for Local SearchINFORMS J. Comput., 11
K. Leino (2010)
Dafny: An Automatic Program Verifier for Functional Correctness
Samuel Brooks (1958)
A Discussion of Random Methods for Seeking MaximaOperations Research, 6
Aishwarya Gupta (2020)
Decision ProceduresDistributed Artificial Intelligence
R. Rubinstein, Dirk Kroese (2004)
The Cross‐Entropy Method
P. Crescenzi, V. Kann (1994)
A compendium of NP optimization problems
(2017)
Master's thesis, Technion, Israel Institute of Technology
B. Huberman, R. Lukose, T. Hogg (1997)
An Economics Approach to Hard Computational ProblemsScience, 275
C. Sinz (2005)
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
H. Hoos, Kevin Leyton-Brown, Torsten Schaub, Marius Schneider (2012)
Algorithm Configuration for Portfolio-based Parallel SAT-Solving
L. Moura, Nikolaj Bjørner (2008)
Z3: An Efficient SMT Solver
S. Forrest, Melanie Mitchell (1992)
Relative Building-Block Fitness and the Building Block Hypothesis
Ernie Cohen, M. Dahlweid, Mark Hillebrand, Dirk Leinenbach, Michal Moskal, T. Santen, Wolfram Schulte, S. Tobies (2009)
VCC: A Practical System for Verifying Concurrent C
G. Smolka (1997)
Principles and Practice of Constraint Programming-CP97, 1330
F. Hutter, H. Hoos, Kevin Leyton-Brown (2011)
Sequential Model-Based Optimization for General Algorithm Configuration
C. Ansótegui, Meinolf Sellmann, Kevin Tierney (2009)
A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms
Yu Pei (2015)
Automatic Fixing of Programs with Contracts
B. Dutertre, L. Moura (2006)
A Fast Linear-Arithmetic Solver for DPLL(T)
Marek Petrik, S. Zilberstein (2006)
Learning parallel portfolios of algorithmsAnnals of Mathematics and Artificial Intelligence, 48
Publisher's note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
Various hard real-time systems have a desired requirement which is impossible to fulfill: to solve a computationally hard optimization problem within a short and fixed amount of time T, e.g., T = 0.5 seconds. For such a task, the exact, exponential algorithms, as well as various Polynomial-Time Approximation Schemes, are irrelevant because they can exceed T. What is left in practice is to combine various anytime algorithms in a parallel portfolio. The question is how to build such an optimal portfolio, given a budget of K computing cores. It is certainly not as simple as choosing the K best performing algorithms, because their results are possibly correlated (e.g., there is no point in choosing two good algorithm for the portfolio if they win on a similar set of instances). We prove that the decision variant of this problem is NP-complete, and furthermore that the optimization problem is approximable. On the practical side, our main contribution is a solution of the optimization problem of choosing K algorithms out of n, for a machine with K computing cores, and the related problem of detecting the minimum number of required cores to achieve an optimal portfolio, with respect to a given training set of instances. As a benchmark, we took instances of a hard optimization problem that is prevalent in the real-time industry, in which the challenge is to decide on the best action within time T. We include the results of numerous experiments that compare the various methods. Hence, a side effect of our tests is that it gives the first systematic empirical evaluation of the relative success of various known stochastic-search algorithms in coping with a hard combinatorial optimization problems under a very short and fixed timeout.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Aug 28, 2020
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.