✦ LIBER ✦

Algorithm for incremental compaction of geometrical layouts

✍ Scribed by S.K. Nandy; L.M. Patnaik

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 701 KB
Volume: 19
Category: Article
ISSN: 0010-4485
DOI: 10.1016/0010-4485(87)90264-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New algorithms based on a multiple stora

New algorithms based on a multiple storage quadtree for hierarchical compaction of VLSI mask layout

✍ P.-Y. Hsiao; W.-S. Feng 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 603 KB

A compact layout for the three-dimension

A compact layout for the three-dimensional tree of meshes

✍ Ronald I. Greenberg; Charles E. Leiserson 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 556 KB

An incremental algorithm for identificat

An incremental algorithm for identification of longest (shortest) paths

✍ Sandip Kundu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A knowledge-based program for compacting

A knowledge-based program for compacting mask layout of integrated circuits

✍ Pei-Yung Hsiao; S.F.Steven Chen; Chia-Chun Tsai; Wu-Shiung Feng 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 819 KB

Recent research in knowledge-based expert systems k)r VLSI tools" design has concentrated on floor-planning, placement, routing, and (:ell generation. The paper describes a knowledge-based scanning-line approach to VLSI layout compaction. This approach differs Jrom traditional algorithmic approaches

Erratum to a compact layout for the thre

Erratum to a compact layout for the three-dimensional tree of meshes

✍ Ronald I. Greenberg; Charles E. Leiserson 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 35 KB

Geometrical interpretation of the back-p

Geometrical interpretation of the back-propagation algorithm for the perceptron

✍ Marco Budinich; Edoardo Milotti 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 528 KB