Sciweavers

885 search results - page 39 / 177
» Optimal Polygon Placement
Sort
View
ISPD
1997
ACM
74views Hardware» more  ISPD 1997»
15 years 6 months ago
A matrix synthesis approach to thermal placement
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...
Chris C. N. Chu, D. F. Wong
ASPDAC
2005
ACM
92views Hardware» more  ASPDAC 2005»
15 years 3 months ago
An LP-based methodology for improved timing-driven placement
— A method for timing driven placement is presented. The core of the approach is optimal timing-driven relaxed placement based on a linear programming (LP) formulation. The formu...
Qingzhou (Ben) Wang, John Lillis, Shubhankar Sanya...
COR
2006
94views more  COR 2006»
15 years 2 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
IPL
2008
70views more  IPL 2008»
15 years 1 months ago
Minimum-perimeter enclosures
We give efficient algorithms for computing a minimum-perimeter k-gon that encloses a given n-gon. Key words: Computational Geometry, Polygon Optimization
Joseph S. B. Mitchell, Valentin Polishchuk
INTEGRATION
2006
82views more  INTEGRATION 2006»
15 years 1 months ago
On whitespace and stability in physical synthesis
In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible ...
Saurabh N. Adya, Igor L. Markov, Paul G. Villarrub...