336 search results - page 8 / 68 » On structure and suboptimality in placement |
IJRR
2008
13 years 8 months ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
ISPD
2012
ACM
12 years 4 months ago
2012
ACM
As technology scales and frequency increases, a new design style is emerging, referred to as hybrid designs, which contain a mixture of random logic and datapath standard cell com...
ICCAD
2008
IEEE
14 years 5 months ago
2008
IEEE
—This paper presents an efficient technique for the estimation of the routed wirelength during global placement using the wire density of the net. The proposed method identifie...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— We consider the problem of designing controllers for spatially-varying interconnected systems distributed in one spatial dimension. The matrix structure of such systems can be ...
FPGA
2003
ACM
14 years 1 months ago
2003
ACM
To truly exploit FPGAs for rapid turn-around development and prototyping, placement times must be reduced to seconds; latebound, reconfigurable computing applications may demand p...