Sciweavers

43 search results - page 2 / 9
» Sorting by Placement and Shift
Sort
View
ICCAD
2006
IEEE
129views Hardware» more  ICCAD 2006»
13 years 11 months ago
A high-quality mixed-size analytical placer considering preplaced blocks and density constraints
In addition to wirelength, modern placers need to consider various constraints such as preplaced blocks and density. We propose a high-quality analytical placement algorithm consi...
Tung-Chieh Chen, Zhe-Wei Jiang, Tien-Chang Hsu, Hs...
SCHEDULING
2010
59views more  SCHEDULING 2010»
13 years 4 months ago
Implicit shift scheduling with multiple breaks and work stretch duration restrictions
This paper considers a shift scheduling problem that includes different forms of flexibility in terms of shift starting times, break lengths and break placement. Two particular ...
Monia Rekik, Jean-François Cordeau, Fran&cc...
ACCV
2009
Springer
14 years 7 days ago
Evolving Mean Shift with Adaptive Bandwidth: A Fast and Noise Robust Approach
Abstract. This paper presents a novel nonparametric clustering algorithm called evolving mean shift (EMS) algorithm. The algorithm iteratively shrinks a dataset and generates well ...
Qi Zhao, Zhi Yang, Hai Tao, Wentai Liu
DAC
2009
ACM
14 years 6 months ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu
TVCG
2010
129views more  TVCG 2010»
13 years 4 months ago
Projector Placement Planning for High Quality Visualizations on Real-World Colored Objects
—Many visualization applications benefit from displaying content on real-world objects rather than on a traditional display (e.g., a monitor). This type of visualization display ...
Alvin J. Law, Daniel G. Aliaga, Aditi Majumder