3591 search results - page 86 / 719 » Typing linear constraints |
86
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we consider the problem of classification in the presence of pairwise constraints, which consist of pairs of examples as well as a binary variable indicating whether...
103
click to vote
CP
2005
Springer
15 years 6 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...
117
click to vote
IJCAI
1989
15 years 1 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
99
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
107
Voted
SIAMJO
2008
15 years 20 days ago
2008
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...