Sciweavers

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

6

JEA
2000

favoriteEmaildiscussreport

37views more JEA 2000»

Design and Implementation of Move-Based Heuristics for VLSI Hypergraph Partitioning

13 years 6 months ago

Design and Implementation of Move-Based Heuristics for VLSI Hypergraph Partitioning

Download vlsicad.ucsd.edu

Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko

Real-time Traffic

JEA 2000 |

claim paper

Related Content

» Hypergraph Partitioning for VLSI CAD Methodology for Heuristic Development Experimentation...

» Improved algorithms for hypergraph bipartitioning

» Hypergraph Partitioning with Fixed Vertices

» Circuit Bipartitioning Using Genetic Algorithm

» FORCE a fast and easytoimplement variableordering heuristic

» Generating FPGAAccelerated DFT Libraries

» Can recursive bisection alone produce routable placements

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	JEA
Authors	Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov

Comments (0)