817 search results - page 48 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
ISPD
1997
ACM
14 years 27 days ago
1997
ACM
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
DAC
1999
ACM
14 years 9 months ago
1999
ACM
Recently, several algorithms for interconnect optimization via repeater insertion and wire sizing have appeared based on the Elmore delay model. Using the Devgan noise metric [6] ...
EURODAC
1994
IEEE
14 years 25 days ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
IPCO
2010
13 years 6 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
DAC
2005
ACM
13 years 10 months ago
2005
ACM
This paper presents a novel placement algorithm for timing optimization based on a new and powerful concept, which we term differential timing analysis. Recognizing that accurate ...