Login / Signup
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution.
Yu-Liang Wu
Douglas Chang
Published in:
ICCAD (1994)
Keyphrases
</>
optimal solution
dedicated hardware
high speed
real time
linear equations
lower bound
routing algorithm
integer programming
social networks
web services
wireless sensor networks
routing protocol
end to end
ad hoc networks
computing systems
field programmable gate array