Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...