Sciweavers

5889 search results - page 40 / 1178
» Graph Layout Problems
Sort
View
ISPD
2007
ACM
151views Hardware» more  ISPD 2007»
13 years 11 months ago
Pattern sensitive placement for manufacturability
When VLSI technology scales toward 45nm, the lithography wavelength stays at 193nm. This large gap results in strong refractive effects in lithography. Consequently, it is a huge...
Shiyan Hu, Jiang Hu
ISAAC
2007
Springer
111views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
Jiong Guo
ICCAD
1996
IEEE
106views Hardware» more  ICCAD 1996»
14 years 2 months ago
Interchangeable pin routing with application to package layout
Many practical routing problems such as BGA, PGA, pin redistribution and test xture routing involve routing with interchangeable pins. These routing problems, especiallypackage la...
Man-Fai Yu, Joel Darnauer, Wayne Wei-Ming Dai
VL
1992
IEEE
192views Visual Languages» more  VL 1992»
14 years 1 months ago
Graphic Object Layout with Interactive Genetic Algorithms
Automatic graphic objectlayout methods havelong been studied in many application areas in which graphic objects should be laid out to satisfy the constraints specific to each appl...
Toshiyuki Masui
CGF
2011
13 years 1 months ago
Interactive Modeling of City Layouts using Layers of Procedural Content
In this paper, we present new solutions for the interactive modeling of city layouts that combine the power of procedural modeling with the flexibility of manual modeling. Proced...
Markus Lipp, Daniel Scherzer, Peter Wonka, Michael...