Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

119

Voted

ASPDAC
2001
ACM

95views Hardware» more ASPDAC 2001»

FAST-SP: a fast algorithm for block placement based on sequence pair

15 years 6 months ago

FAST-SP: a fast algorithm for block placement based on sequence pair

Download eda.ee.ntu.edu.tw

Xiaoping Tang, D. F. Wong

Real-time Traffic

ASPDAC 2001 | Hardware |

claim paper

Related Content

» Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computat...

» Fast wire length estimation by net bundling for block placement

» BusDriven Floorplanning

» Multibend bus driven floorplanning

» Fusion Moves for Markov Random Field Optimization

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2001
Where	ASPDAC
Authors	Xiaoping Tang, D. F. Wong

Comments (0)