152 search results - page 18 / 31 » Solving hard instances of floorplacement |
DATE
1999
IEEE
14 years 22 days ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
CONSTRAINTS
2006
13 years 8 months ago
2006
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
We review the notion of hypertree width, a measure of the degree of cyclicity of hypergraphs that is useful for identifying and solving efficiently easy instances of hard problems...
CP
2004
Springer
14 years 1 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 ...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
Abstract. Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. S...