We propose various static as well as dynamic scheduling strategies, and demonstrate that in comparison to pure algorithm selection, our novel combination of scheduling and solver …
Boolean constraint solving technology has made tremendous progress over the last decade, leading to industrial-strength solvers, for example, in the areas of answer set programming …
The Algorithm Selection Problem is concerned with selecting the best algorithm to solve a given problem on a case-by-case basis. It has become especially relevant in the last decade, as
Principles of Constraint Programming Krzysztof R. Apt CWI, Amsterdam, The Netherlands ... 3.2.7 Constraint propagation algorithms 70 3.3 Example: Boolean constraints 71 3.4 Example: …
We are addressing an instance of the Algorithm Selection Problem [26], which, given variable performance among a set of algorithms, is to choose the best candidate for a particular …
Handbook of Constraint Programming Edited by F. Rossi, P. van Beek and T. Walsh Elsevier
Idea: First runs a static schedule of algorithms (independent of given instance). If it fails, use algorithm selection (based on instance features). Insight [Gonard et al. 2016] : Pre-solving …
A Constraint Satisfaction Problem (CSP) is a triple X,D,C where: X is a set of variables, {x1,...,xn}; D is a set of domains, D1,...,Dn associated with x1,...,xn re-spectively; and C is a set of …
In this paper, we introduce the probe and solve algorithm (PSA), which uses hyperparameter optimization (HPO) tech-niques to explore and identify the most effective search strat-egy for a …
In this paper we focus on the last two strategies, and we show how al-gorithmic techniques can be helpful. In Section 3 we will describe two polynomial-time ltering algorithms. The rst one, which …