3838 search results - page 129 / 768 » Techniques for Optimization of Net Algorithms |
166
click to vote
ISVLSI
2002
IEEE
15 years 11 months ago
2002
IEEE
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
155
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
1 We propose an integrated technique for extensive optimization of the final test solution for System-on-Chip using Simulated Annealing. The produced results from the technique ar...
185
click to vote
FOCS
2008
IEEE
16 years 21 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
139
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
174
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Designing storage area networks is an NP-hard problem. Previous work has focused on traditional algorithmic techniques to automatically determine fabric requirements, net...