Funding: UK EPSRC grant EP/P015638/1.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 f...
The use of generic and generative methods for the development and application of interactive educati...
Algorithmic generation of data, known as procedural content generation, is an attractive prospect wi...
In this paper, we present a general technique to generate and evaluate puzzle levels made by Puzzle ...
Access to good benchmark instances is always desirable when developing new algorithms, new constrain...
Funding: This work is supported by EPSRC grant EP/P015638/1. Nguyen Dang is a Leverhulme Early Caree...
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...
One approach to automated constraint modelling is to generate, and then select from, a set of candid...
In recent years, ranking approaches to Natural Language Generation have become increasingly popular....
In a previous paper {SF88] topics associated with the construction and generation of lan guage insta...
Malitsky Y, Merschformann M, O’Sullivan B, Tierney K. Structure-Preserving Instance Generation. In: ...
The propositional satisfiability problem (SAT) is one of the most promi-nent and widely studied NP-h...
Program Generation (PG) is about writing programs that write programs. A program generator composes...
Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to ...
The use of generic and generative methods for the development and application of interactive educati...
Algorithmic generation of data, known as procedural content generation, is an attractive prospect wi...
In this paper, we present a general technique to generate and evaluate puzzle levels made by Puzzle ...
Access to good benchmark instances is always desirable when developing new algorithms, new constrain...
Funding: This work is supported by EPSRC grant EP/P015638/1. Nguyen Dang is a Leverhulme Early Caree...
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...
One approach to automated constraint modelling is to generate, and then select from, a set of candid...
In recent years, ranking approaches to Natural Language Generation have become increasingly popular....
In a previous paper {SF88] topics associated with the construction and generation of lan guage insta...
Malitsky Y, Merschformann M, O’Sullivan B, Tierney K. Structure-Preserving Instance Generation. In: ...
The propositional satisfiability problem (SAT) is one of the most promi-nent and widely studied NP-h...
Program Generation (PG) is about writing programs that write programs. A program generator composes...
Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to ...
The use of generic and generative methods for the development and application of interactive educati...
Algorithmic generation of data, known as procedural content generation, is an attractive prospect wi...
In this paper, we present a general technique to generate and evaluate puzzle levels made by Puzzle ...