Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
Branislav Kveton, Milos Hauskrecht, Carlos Guestri...
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...