Sciweavers

3598 search results - page 3 / 720
» New efficient algorithms for computing effective capacitance
Sort
View
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 5 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
CSC
2008
13 years 6 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger
ASPDAC
2004
ACM
111views Hardware» more  ASPDAC 2004»
13 years 10 months ago
Gate delay calculation considering the crosstalk capacitances
In this paper, we present a new technique for calculating the output waveform of CMOS drivers for cross-coupled RC loads. The proposed technique is based on an effective capacitan...
Soroush Abbaspour, Massoud Pedram
DAC
2001
ACM
14 years 6 months ago
A2BC: Adaptive Address Bus Coding for Low Power Deep Sub-Micron Designs
Due to larger buses (length, width) and deep sub-micron effects where coupling capacitances between bus lines are in the same order of magnitude as base capacitances, power consum...
Haris Lekatsas, Jörg Henkel
ICCD
1999
IEEE
99views Hardware» more  ICCD 1999»
13 years 9 months ago
Efficient Crosstalk Estimation
With the reducing distances between wires in deep submicron technologies, coupling capacitances are becoming significant as their magnitude becomes comparable to the area capacita...
Martin Kuhlmann, Sachin S. Sapatnekar, Keshab K. P...