3838 search results - page 28 / 768 » Techniques for Optimization of Net Algorithms |
EURODAC
1995
IEEE
15 years 1 months ago
1995
IEEE
Most existing performance-driven and clock routing algorithms can not guarantee performance after all nets are routed. This paper proposes a new post routing approach which can re...
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
An optimization algorithm for the design of combinational circuits that are robust to single-event upsets (SEUs) is described. A simple, highly accurate model for the SEU robustne...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
100
click to vote
IGARSS
2009
14 years 7 months ago
2009
A novel STAP algorithm based on sparse recovery technique, called CS-STAP, were presented. Instead of using conventional maximum likelihood estimation of covariance matrix, our met...
INFOCOM
1999
IEEE
15 years 1 months ago
1999
IEEE
In this paper, we propose and study a new technique, which we call cache-based compaction for reducing the latency of Web browsing over a slow link. Our compaction technique trades...