729 search results - page 46 / 146 » Solving subgraph isomorphism problems with constraint progra... |
123
click to vote
VLSID
2003
IEEE
16 years 4 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
110
Voted
CP
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we study four algorithms for computing the frequency of a given partial order. Here the frequency of a partial order is the number of standard labellings respecting t...
126
Voted
TSC
2010
14 years 10 months ago
2010
Today's data centers offer IT services mostly hosted on dedicated physical servers. Server virtualization provides a technical means for server consolidation. Thus, multiple v...
108
Voted
CP
2004
Springer
15 years 9 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
102
Voted
CP
2004
Springer
15 years 9 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 ...