Sciweavers

2057 search results - page 12 / 412
» Quadratic placement using an improved timing model
Sort
View
ASPDAC
2006
ACM
98views Hardware» more  ASPDAC 2006»
14 years 21 days ago
Timing-driven placement based on monotone cell ordering constraints
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
Chanseok Hwang, Massoud Pedram
EUROPAR
2003
Springer
13 years 12 months ago
Replicated Placements in the Polyhedron Model
Abstract. Loop-carried code placement (LCCP) is able to remove redundant computations that cannot be recognized by traditional code motion techniques. However, this comes possibly ...
Peter Faber, Martin Griebl, Christian Lengauer
EACL
2006
ACL Anthology
13 years 8 months ago
CDER: Efficient MT Evaluation Using Block Movements
Most state-of-the-art evaluation measures for machine translation assign high costs to movements of word blocks. In many cases though such movements still result in correct or alm...
Gregor Leusch, Nicola Ueffing, Hermann Ney
GRAPHICSINTERFACE
2004
13 years 8 months ago
Improving Menu Placement Strategies for Pen Input
We investigate menu selection in circular and rectangular pop-up menus using stylus-driven direct input on horizontal and vertical display surfaces. An experiment measured perform...
Mark S. Hancock, Kellogg S. Booth
ASPDAC
2008
ACM
200views Hardware» more  ASPDAC 2008»
13 years 8 months ago
Non-Gaussian statistical timing analysis using second-order polynomial fitting
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...
Lerong Cheng, Jinjun Xiong, Lei He