Sciweavers

193 search results - page 8 / 39
» The Capacitated m-Ring-Star Problem
Sort
View
ESCAPE
2007
Springer
228views Algorithms» more  ESCAPE 2007»
15 years 5 months ago
Online Capacitated Interval Coloring
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
Leah Epstein, Thomas Erlebach, Asaf Levin
ICCD
2004
IEEE
135views Hardware» more  ICCD 2004»
15 years 8 months ago
Design Methodologies and Architecture Solutions for High-Performance Interconnects
In Deep Sub-Micron (DSM) technologies, interconnects play a crucial role in the correct functionality and largely impact the performance of complex System-on-Chip (SoC) designs. F...
Davide Pandini, Cristiano Forzan, Livio Baldi
TCAD
2010
130views more  TCAD 2010»
14 years 5 months ago
On ATPG for Multiple Aggressor Crosstalk Faults
Crosstalk faults have emerged as a significant mechanism for circuit failure. Long signal nets are of particular concern because they tend to have a higher coupling capacitance to...
Kunal P. Ganeshpure, Sandip Kundu
VLSID
2004
IEEE
73views VLSI» more  VLSID 2004»
15 years 11 months ago
Wire Swizzling to Reduce Delay Uncertainty Due to Capacitive Coupling
Reduction of worst-case delay and delay uncertainty due to capacitive coupling is a still unsolved problem in physical design. We describe a routing only layout solution - swizzli...
Puneet Gupta, Andrew B. Kahng
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
15 years 5 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...