7092 search results - page 364 / 1419 » Parallelizing constraint programs |
126
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
134
click to vote
CP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Although algorithms for Distributed Constraint Optimization Problems (DCOPs) have emerged as a key technique for distributed reasoning, their application faces significa...
118
click to vote
CP
2004
Springer
15 years 8 months ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
104
click to vote
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...
116
click to vote
CHI
1992
ACM
15 years 7 months ago
1992
ACM
We describe enhancements to graphical search and replace that allow users to extend the capabilities of a graphical editor. Interactive constraint-based search and replace can sea...