935 search results - page 38 / 187 » A New Statistical Optimization Algorithm for Gate Sizing |
126
click to vote
JGAA
2006
15 years 2 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
102
click to vote
ASIACRYPT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
112
Voted
DAC
2003
ACM
16 years 3 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
110
click to vote
EOR
2008
15 years 2 months ago
2008
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
136
Voted
ICCAD
1997
IEEE
15 years 6 months ago
1997
IEEE
Traditional synthesis techniques optimize CMOS circuits in two phases i) logic minimization and ii) library mapping phase. Typically, the structures and the sizes of the gates in ...