193 search results - page 28 / 39 » The Capacitated m-Ring-Star Problem |
126
Voted
NETWORKS
2008
15 years 3 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
142
click to vote
WADS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
113
Voted
ICCAD
2006
IEEE
16 years 15 days ago
2006
IEEE
Process variations cause different behavior of timingdependent effects across different chips. In this work, we analyze one example of timing-dependent effects, crosscoupling ...
120
Voted
DAC
1999
ACM
16 years 4 months ago
1999
ACM
We propose a new VLSI layout methodology which addresses the main problems faced in Deep Sub-Micron (DSM) integrated circuit design. Our layout "fabric" scheme eliminate...
115
Voted
ICCD
2006
IEEE
16 years 16 days ago
2006
IEEE
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...