283 search results - page 53 / 57 » Solving Over-Constrained Problems with SAT |
112
Voted
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
128
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
142
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
139
Voted
ECCC
2007
15 years 3 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
113
Voted
DAC
2002
ACM
16 years 4 months ago
2002
ACM
We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving. Enabl...