Sciweavers

3838 search results - page 129 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
129
Voted
ISVLSI
2002
IEEE
129views VLSI» more  ISVLSI 2002»
15 years 8 months ago
Accelerating Retiming Under the Coupled-Edge Timing Model
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...
Ingmar Neumann, Kolja Sulimma, Wolfgang Kunz
126
Voted
ICCAD
2001
IEEE
113views Hardware» more  ICCAD 2001»
16 years 17 days ago
The Design and Optimization of SOC Test Solutions
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...
Erik Larsson, Zebo Peng, Gunnar Carlsson
146
Voted
FOCS
2008
IEEE
15 years 10 months ago
Constant-Time Approximation Algorithms via Local Improvements
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...
Huy N. Nguyen, Krzysztof Onak
118
Voted
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
15 years 8 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
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...
Kevin D. Wayne
140
Voted
GECCO
2004
Springer
103views Optimization» more  GECCO 2004»
15 years 9 months ago
Using a Genetic Algorithm to Design and Improve Storage Area Network Architectures
Abstract. Designing storage area networks is an NP-hard problem. Previous work has focused on traditional algorithmic techniques to automatically determine fabric requirements, net...
Elizabeth Dicke, Andrew Byde, Paul J. Layzell, Dav...