The field of HCI has played an important role in broadening the spectrum of users of computational artifacts. However, users with extreme preferences are mostly ignored by the des...
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
Koza has shown how automatically defined functions (ADFs) can reduce computational effort in the GP paradigm. In Koza's ADF, as well as in standard GP, an improvement in a par...