2715 search results - page 66 / 543 » Total Generalized Variation |
130
Voted
IPCO
1998
15 years 2 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
COR
2008
15 years 23 days ago
2008
This paper addresses the problem of minimizing the expected cost of locating a number of single product facilities and allocating uncertain customer demand to these facilities. Th...
86
Voted
ICCAD
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we propose the first wire density driven global routing that considers CMP variation and timing. To enable CMP awareness during global routing, we propose a compac...
97
Voted
ISPD
2006
ACM
15 years 6 months ago
2006
ACM
Advances in VLSI technology make clock skew more susceptible to process variations. Notwithstanding efficient zero skew routing algorithms, clock skew still limits post-manufactu...
70
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present two important variations on a recently successful bloat control technique, Dynamic Maximum Tree Depth, intended at further improving the results and extending ...