Sciweavers

3838 search results - page 62 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
14 years 10 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
CC
2007
Springer
107views System Software» more  CC 2007»
15 years 4 months ago
A Fast Cutting-Plane Algorithm for Optimal Coalescing
Abstract. Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorith...
Daniel Grund, Sebastian Hack
DAC
2005
ACM
14 years 11 months ago
Timing-driven placement by grid-warping
Grid-warping is a recent placement strategy based on a novel physical analogy: rather than move the gates to optimize their location, it elastically deforms a model of the 2-D chi...
Zhong Xiu, Rob A. Rutenbar
ISPD
1999
ACM
95views Hardware» more  ISPD 1999»
15 years 2 months ago
Incremental capacitance extraction and its application to iterative timing-driven detailed routing
In this paper, we consider delay optimization in multilayer detailed routing. Given a detailed routing by some detailed router, we iteratively improve the delays of critical nets ...
Yanhong Yuan, Prithviraj Banerjee
COMPUTING
2007
127views more  COMPUTING 2007»
14 years 9 months ago
Analyzing a generalized Loop subdivision scheme
In this paper a class of subdivision schemes generalizing the algorithm of Loop is presented. The stencils have the same support as those from the algorithm of Loop, but allow a v...
Ingo Ginkel, Georg Umlauf