Sciweavers

403 search results - page 59 / 81
» Variable ranges in linear constraints
Sort
View
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
14 years 9 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
15 years 6 months ago
A linear-time approach for static timing analysis covering all process corners
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
Sari Onaissi, Farid N. Najm
SAC
2005
ACM
15 years 3 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
EMO
2005
Springer
126views Optimization» more  EMO 2005»
15 years 3 months ago
The Evolution of Optimality: De Novo Programming
Abstract. Evolutionary algorithms have been quite effective in dealing with single-objective “optimization” while the area of Evolutionary Multiobjective Optimization (EMOO) h...
Milan Zeleny
ISQED
2002
IEEE
111views Hardware» more  ISQED 2002»
15 years 2 months ago
Optimization of the Power/Ground Network Wire-Sizing and Spacing Based on Sequential Network Simplex Algorithm
This paper presents a fast algorithm to optimize both the widths and lengths of power/ground networks under reliability and power dip/ground bounce constraints. The spacesizing wh...
Ting-Yuan Wang, Charlie Chung-Ping Chen