88 search results - page 10 / 18 » Faster constraint solving with subtypes |
NIPS
2008
13 years 9 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
FMCAD
2007
Springer
14 years 1 months ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
AIED
2005
Springer
14 years 1 months ago
2005
Springer
: Several studies have shown that explaining actions increases students’ knowledge. In this paper, we discuss how NORMIT supports self-explanation. NORMIT is a constraint-based t...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...