592 search results - page 38 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
115
click to vote
ICCAD
1996
IEEE
15 years 7 months ago
1996
IEEE
In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We de ne a class of optimization problems as CH-posynomial programs and reveal a genera...
CP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search ...
102
click to vote
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
148
click to vote
JSAT
2010
14 years 9 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
123
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...