This work is supported by EPSRC grant EP/P015638/1 and used the Cirrus UK National Tier-2 HPC Service at EPCC funded by the University of Edinburgh and EPSRC (EP/P020267/1).We extend automatic instance generation methods to allow cross-paradigm comparisons. We demonstrate that it is possible to completely automate the search for benchmark instances that help to discriminate between solvers. Our system starts from a high level human-provided problem specification, which is translated into a specification for valid instances. We use the automated algorithm configuration tool irace to search for instances, which are translated into inputs for both MIP and CP solvers by means of the Conjure, Savile Row, and MiniZinc tools. These instances are t...
Finding interesting patterns is a challenging task in data mining. Constraint based mining is a well...
Abstract. In this paper we describe the new system ME-ASP, which applies ma-chine learning technique...
The propositional satisfiability problem (SAT) is one of the most promi-nent and widely studied NP-h...
This work is supported by EPSRC grant EP/P015638/1 and used the Cirrus UK National Tier-2 HPC Servic...
We extend automatic instance generation methods to allow cross-paradigm comparisons. We demonstrate ...
Benchmarking is an important tool for assessing the relative performance of alternative solving appr...
One approach to automated constraint modelling is to generate, and then select from, a set of candid...
Access to good benchmark instances is always desirable when developing new algorithms, new constrain...
Aspects of a classifier\u27s training dataset can often make building a helpful and high accuracy cl...
International audienceWe consider a generic binary CSP solver parameterized by high-level design cho...
Constraint satisfaction problems are of special interest for the artificial intelligence and operati...
The empirical study of algorithms is a crucial topic in the design of new algorithms because the con...
Python-MIP 1.11.0 Two additional parameters, three depth and pass number, are now informed to the g...
Understanding the behaviour of heuristic search methods is a challenge. This even holds for simple l...
Understanding the behaviour of heuristic search methods is a challenge. This even holds for simple l...
Finding interesting patterns is a challenging task in data mining. Constraint based mining is a well...
Abstract. In this paper we describe the new system ME-ASP, which applies ma-chine learning technique...
The propositional satisfiability problem (SAT) is one of the most promi-nent and widely studied NP-h...
This work is supported by EPSRC grant EP/P015638/1 and used the Cirrus UK National Tier-2 HPC Servic...
We extend automatic instance generation methods to allow cross-paradigm comparisons. We demonstrate ...
Benchmarking is an important tool for assessing the relative performance of alternative solving appr...
One approach to automated constraint modelling is to generate, and then select from, a set of candid...
Access to good benchmark instances is always desirable when developing new algorithms, new constrain...
Aspects of a classifier\u27s training dataset can often make building a helpful and high accuracy cl...
International audienceWe consider a generic binary CSP solver parameterized by high-level design cho...
Constraint satisfaction problems are of special interest for the artificial intelligence and operati...
The empirical study of algorithms is a crucial topic in the design of new algorithms because the con...
Python-MIP 1.11.0 Two additional parameters, three depth and pass number, are now informed to the g...
Understanding the behaviour of heuristic search methods is a challenge. This even holds for simple l...
Understanding the behaviour of heuristic search methods is a challenge. This even holds for simple l...
Finding interesting patterns is a challenging task in data mining. Constraint based mining is a well...
Abstract. In this paper we describe the new system ME-ASP, which applies ma-chine learning technique...
The propositional satisfiability problem (SAT) is one of the most promi-nent and widely studied NP-h...