753 search results - page 23 / 151 » Completing a (k - 1)-Assignment |
ISPD
1998
ACM
15 years 2 months ago
1998
ACM
In this paper, we present a performance-driven softmacro clustering and placement method which preserves HDL design hierarchy to guide the soft-macro placement process. We also pr...
100
click to vote
GC
2008
Springer
14 years 9 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
MOC
2000
14 years 9 months ago
2000
Let K be a totally real algebraic number field and O an order in a quaternion algebra A over K. Assume that the group O1 of units in O with reduced norm equal to 1 is embedded into...
CCCG
2009
14 years 7 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
ICCAD
2005
IEEE
15 years 6 months ago
2005
IEEE
We discuss a new synthesis flow, which offers the ability to do easy delay testing almost free in terms of its impact on speed and area as compared to corresponding implementation...