Access to good benchmark instances is always desirable when developing new algorithms, new constraint models, or when comparing existing ones. Hand-written instances are of limited utility and are time-consuming to produce. A common method for generating instances is constructing special purpose programs for each class of problems. This can be better than manually producing instances, but developing such instance generators also has drawbacks. In this paper, we present a method for generating graded instances completely automatically starting from a class-level problem specification. A graded instance in our present setting is one which is neither too easy nor too difficult for a given solver. We start from an abstract problem specification...
This paper proposes an automatic way of evolving level generators for arbitrary 2D games, which are ...
Malitsky Y, Merschformann M, O’Sullivan B, Tierney K. Structure-Preserving Instance Generation. In: ...
A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one form...
Funding: UK EPSRC grant EP/P015638/1.Access to good benchmark instances is always desirable when dev...
Benchmarking is an important tool for assessing the relative performance of alternative solving appr...
We extend automatic instance generation methods to allow cross-paradigm comparisons. We demonstrate ...
This work is supported by EPSRC grant EP/P015638/1 and used the Cirrus UK National Tier-2 HPC Servic...
Funding: This work is supported by EPSRC grant EP/P015638/1. Nguyen Dang is a Leverhulme Early Caree...
One approach to automated constraint modelling is to generate, and then select from, a set of candid...
Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to ...
In a previous paper {SF88] topics associated with the construction and generation of lan guage insta...
The propositional satisfiability problem (SAT) is one of the most promi-nent and widely studied NP-h...
C++ program to generate problem instances for the Score-Constrained Packing Problem. This generator...
Abstract. In this paper we argue that hand-writing a program generator generator has a number of adv...
Many verification approaches use SMT solvers in some form, and are limited by their incomplete handl...
This paper proposes an automatic way of evolving level generators for arbitrary 2D games, which are ...
Malitsky Y, Merschformann M, O’Sullivan B, Tierney K. Structure-Preserving Instance Generation. In: ...
A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one form...
Funding: UK EPSRC grant EP/P015638/1.Access to good benchmark instances is always desirable when dev...
Benchmarking is an important tool for assessing the relative performance of alternative solving appr...
We extend automatic instance generation methods to allow cross-paradigm comparisons. We demonstrate ...
This work is supported by EPSRC grant EP/P015638/1 and used the Cirrus UK National Tier-2 HPC Servic...
Funding: This work is supported by EPSRC grant EP/P015638/1. Nguyen Dang is a Leverhulme Early Caree...
One approach to automated constraint modelling is to generate, and then select from, a set of candid...
Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to ...
In a previous paper {SF88] topics associated with the construction and generation of lan guage insta...
The propositional satisfiability problem (SAT) is one of the most promi-nent and widely studied NP-h...
C++ program to generate problem instances for the Score-Constrained Packing Problem. This generator...
Abstract. In this paper we argue that hand-writing a program generator generator has a number of adv...
Many verification approaches use SMT solvers in some form, and are limited by their incomplete handl...
This paper proposes an automatic way of evolving level generators for arbitrary 2D games, which are ...
Malitsky Y, Merschformann M, O’Sullivan B, Tierney K. Structure-Preserving Instance Generation. In: ...
A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one form...