Sciweavers

1378 search results - page 57 / 276
» The Tractability of Global Constraints
Sort
View
CP
2006
Springer
15 years 9 months ago
The ROOTS Constraint
A wide range of counting and occurrence constraints can be specified with just two global primitives: the Range constraint, which computes the range of values used by a sequence of...
Christian Bessière, Emmanuel Hebrard, Brahi...
ASAP
2005
IEEE
135views Hardware» more  ASAP 2005»
15 years 11 months ago
Via-Aware Global Routing for Good VLSI Manufacturability and High Yield
CAD tools have become more and more important for integrated circuit (IC) design since a complicated system can be designed into a single chip, called system-on-a-chip (SOC), in w...
Yang Yang, Tong Jing, Xianlong Hong, Yu Hu, Qi Zhu...
TCAD
2002
73views more  TCAD 2002»
15 years 5 months ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
CVPR
2012
IEEE
13 years 8 months ago
Linear solution to scale invariant global figure ground separation
We propose a novel linear method for scale invariant figure ground separation in images and videos. Figure ground separation is treated as a superpixel labeling problem. We optim...
Hao Jiang
DAC
2003
ACM
15 years 11 months ago
Force directed mongrel with physical net constraints
This paper describes a new force directed global placement algorithm that exploits and extends techniques from two leading placers, Force-directed [12] [26] and Mongrel [22]. It c...
Sung-Woo Hur, Tung Cao, Karthik Rajagopal, Yegna P...