2543 search results - page 99 / 509 » Optimal Ordered Problem Solver |
132
click to vote
CAV
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
137
click to vote
FMCAD
2007
Springer
15 years 6 months ago
2007
Springer
Parameterized heuristics abound in computer aided design and verification, and manual tuning of the respective parameters is difficult and time-consuming. Very recent results from ...
132
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
151
click to vote
CONSTRAINTS
2010
15 years 3 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
134
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
We show how variational Bayesian inference can be implemented for very large generalized linear models. Our relaxation is proven to be a convex problem for any log-concave model. ...