95 search results - page 7 / 19 » Fast Template Placement for Reconfigurable Computing Systems |
DAC
2005
ACM
14 years 8 months ago
2005
ACM
Previous research has shown both theoretically and practically that simulated annealing can greatly benefit from the incorporation of an adaptive range limiting window to control ...
IEEESCC
2007
IEEE
14 years 2 months ago
2007
IEEE
In today’s fast paced world, it is necessary to process business documents expediently, accurately, and diligently. In other words, processing has to be fast, errors must be pre...
MAM
2006
13 years 7 months ago
2006
FPGA placement and routing is time consuming, often serving as the major obstacle inhibiting a fast edit-compile-test loop in prototyping and development and the major obstacle pr...
CASES
2006
ACM
13 years 11 months ago
2006
ACM
We present a new technique for compiling run-time reconfigurable hardware designs. Run-time reconfigurable embedded systems can deliver promising benefits over implementations in ...
IPPS
1999
IEEE
14 years 4 days ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....