2 search results - page 1 / 1 » On the NP-completeness of regular 2-D FPGA routing architect... |
ICCAD
1994
IEEE
13 years 8 months ago
1994
IEEE
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
DAC
1995
ACM
13 years 8 months ago
1995
ACM
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...