2725 search results - page 237 / 545 » Constraint Solving for Interpolation |
174
click to vote
CP
1998
Springer
15 years 11 months ago
1998
Springer
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
259
click to vote
SAS
1992
Springer
15 years 11 months ago
1992
Springer
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
173
click to vote
CPAIOR
2008
Springer
15 years 9 months ago
2008
Springer
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
158
click to vote
ICIP
2009
IEEE
16 years 8 months ago
2009
IEEE
Sparsity constraints are now very popular to regularized inverse problems. We review several approaches which have been proposed in the last ten years to solve inverse problems su...
194
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...