Sciweavers

305 search results - page 25 / 61
» Geometric programming for circuit optimization
Sort
View
CEC
2010
IEEE
14 years 10 months ago
A novel hybrid evolutionary strategy and its periodization with multi-objective genetic optimizers
— This work investigates the effects of the periodization of local and global multi-objective search algorithms. To this, we introduce a model for periodization and define a new...
Paul Kaufmann, Tobias Knieper, Marco Platzner
MP
1998
113views more  MP 1998»
14 years 11 months ago
Generalized semi-infinite optimization: A first order optimality condition and examples
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) Ix E M}, where M = {x E N"lhi(x ) = 0, i = 1,...,m, G(x,y) /> 0, y E Y(x)} ...
Hubertus Th. Jongen, Jan-J. Rückmann, Oliver ...
DAC
1997
ACM
15 years 4 months ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar
DATE
2009
IEEE
95views Hardware» more  DATE 2009»
15 years 6 months ago
Minimization of NBTI performance degradation using internal node control
—Negative Bias Temperature Instability (NBTI) is a significant reliability concern for nanoscale CMOS circuits. Its effects on circuit timing can be especially pronounced for ci...
David R. Bild, Gregory E. Bok, Robert P. Dick
FCT
2005
Springer
15 years 5 months ago
On the Incompressibility of Monotone DNFs
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
Matthias P. Krieger