Finding correspondences between feature points is one
of the most relevant problems in the whole set of visual
tasks. In this paper we address the problem of matching
a feature ...
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
Constraints can be used to specify declaratively the desired layout of a web document. We present a system architecture in which both the author and the viewer can impose page lay...
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...