Sciweavers

1151 search results - page 53 / 231
» Modelling Digital Circuits Problems with Set Constraints
Sort
View
DAGM
2004
Springer
15 years 3 months ago
Pixel-to-Pixel Matching for Image Recognition Using Hungarian Graph Matching
A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suita...
Daniel Keysers, Thomas Deselaers, Hermann Ney
AGP
1999
IEEE
15 years 2 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
CPAIOR
2005
Springer
15 years 3 months ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
CONCUR
2010
Springer
14 years 10 months ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa
CPAIOR
2009
Springer
15 years 4 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...