850 search results - page 71 / 170 » Constraint propagation on quadratic constraints |
110
click to vote
FLAIRS
2008
15 years 27 days ago
2008
Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in PseudoBoolean Opti...
180
click to vote
POPL
2001
ACM
16 years 3 days ago
2001
ACM
We present a type system for a language based on F, which allows certain type annotations to be elided in actual programs. Local type inference determines types by a combination o...
124
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
105
click to vote
WLP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
104
click to vote
AUTOMATICA
2004
14 years 11 months ago
2004
Ellipsoidal outer-bounding of the set of all feasible state vectors under model uncertainty is a natural extension of state estimation for deterministic models with unknown-but-bo...