749 search results - page 57 / 150 » Dualities for Constraint Satisfaction Problems |
153
click to vote
KCAP
2005
ACM
16 years 5 days ago
2005
ACM
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
184
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
177
click to vote
ACL
1990
15 years 7 months ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
163
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
170
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...