Sciweavers

999 search results - page 36 / 200
» Constraints in Non-Boolean Contexts
Sort
View
AI
2005
Springer
15 years 6 months ago
Asynchronous aggregation and consistency in distributed constraint satisfaction
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
Marius-Calin Silaghi, Boi Faltings
ICIP
2001
IEEE
16 years 7 months ago
Application of the motion vector constraint to the regularized enhancement of compressed video
In this paper, we present a novel fidelity constraint for the image enhancement problem by exploiting the motion vectors of a compressed video bit-stream. These vectors establish ...
C. Andrew Segall, Aggelos K. Katsaggelos
CSE
2009
IEEE
16 years 24 days ago
Privacy-Preserving Multi-agent Constraint Satisfaction
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
Thomas Léauté, Boi Faltings
CSCLP
2007
Springer
16 years 6 days ago
A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of ...
Krzysztof R. Apt, Francesca Rossi, Kristen Brent V...
FQAS
2004
Springer
122views Database» more  FQAS 2004»
15 years 9 months ago
Simplification of Integrity Constraints with Aggregates and Arithmetic Built-Ins
In the context of relational as well as deductive databases, correct and efficient integrity checking is a crucial issue, as, without any guarantee of data consistency, the answers...
Davide Martinenghi