Sciweavers

126 search results - page 14 / 26
» A Global Constraint for Total Weighted Completion Time
Sort
View
ASPDAC
2007
ACM
77views Hardware» more  ASPDAC 2007»
15 years 3 months ago
Hippocrates: First-Do-No-Harm Detailed Placement
Physical synthesis optimizations and engineering change orders typically change the locations of cells, resize cells or add more cells to the design after global placement. Unfort...
Haoxing Ren, David Z. Pan, Charles J. Alpert, Gi-J...
RC
2002
72views more  RC 2002»
14 years 11 months ago
Symbolic Preconditioning with Taylor Models: Some Examples
Deterministic global optimization with interval analysis involves - using interval enclosures for ranges of the constraints, objective, and gradient to reject infeasible regions, r...
R. Baker Kearfott, G. William Walster
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
15 years 3 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
ICCAD
2006
IEEE
101views Hardware» more  ICCAD 2006»
15 years 8 months ago
Guaranteeing performance yield in high-level synthesis
Meeting timing constraint is one of the most important issues for modern design automation tools. This situation is exacerbated with the existence of process variation. Current hi...
Wei-Lun Hung, Xiaoxia Wu, Yuan Xie
ICALP
2011
Springer
14 years 3 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli