Sciweavers

3850 search results - page 539 / 770
» Optimal Linear Broadcast
Sort
View
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 10 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
ICCAD
1996
IEEE
80views Hardware» more  ICCAD 1996»
15 years 10 months ago
Generalized constraint generation in the presence of non-deterministic parasitics
In a constraint-drivenlayout synthesisenvironment,parasitic constraints are generated and implemented in each phase of the design process to meet a given set of performance specif...
Edoardo Charbon, Paolo Miliozzi, Enrico Malavasi, ...
DAC
1996
ACM
15 years 10 months ago
A Parallel Precorrected FFT Based Capacitance Extraction Program for Signal Integrity Analysis
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...
Narayan R. Aluru, V. B. Nadkarni, James White
STOC
1996
ACM
97views Algorithms» more  STOC 1996»
15 years 10 months ago
Deterministic Restrictions in Circuit Complexity
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
Shiva Chaudhuri, Jaikumar Radhakrishnan
SRDS
1994
IEEE
15 years 10 months ago
Probabilistic Internal Clock Synchronization
We propose an improved probabilistic method for reading remote clocks in systems subject to unbounded communication delays and use this method to design a family of fault-tolerant...
Flaviu Cristian, Christof Fetzer