Sciweavers

- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...

Pierre G. Paulin, John P. Knight

claim paper

Read More »

191

Voted

DAC
1989
ACM

173views Computer Architecture» more DAC 1989»

Fast Hypergraph Partition

15 years 12 months ago

Download vlsicad.ucsd.edu

We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...

Andrew B. Kahng

claim paper

Read More »

215

Voted

DAC
1989
ACM

154views Computer Architecture» more DAC 1989»

A New Approach to the Rectilinear Steiner Tree Problem

15 years 12 months ago

Download users.ece.utexas.edu

: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...

Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong

claim paper

Read More »

202

Voted

DAC
1989
ACM

141views Computer Architecture» more DAC 1989»

An Efficient Finite Element Method for Submicron IC Capacitance Extraction

15 years 11 months ago

Download cas.et.tudelft.nl

We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...

N. P. van der Meijs, Arjan J. van Genderen

claim paper

Read More »

All Subjects

Algorithms

Applied Computing

Artificial Intelligence

Automated Reasoning

Communications

Computational Linguistics

Computer Architecture

Computer Graphics