13841 search results - page 363 / 2769 » Algorithms and Constraint Programming |
185
click to vote
CP
2005
Springer
16 years 10 days 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...
167
click to vote
CP
2004
Springer
16 years 6 days 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...
153
click to vote
ICLP
1997
Springer
15 years 11 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...
160
click to vote
CHI
1992
ACM
15 years 11 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...
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...