Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
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...
Optical flow provides a constraint on the motion of a deformable model. We derive and solve a dynamic system incorporating flow as a hard constraint, producing a model-based least...
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...