18306 search results - page 292 / 3662 » Algorithmics in Exponential Time |
165
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
153
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Starting from a model of the within-die systematic variations using principal components analysis, a model is proposed for estimation of the parametric yield, and is then applied ...
152
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
We propose a false-path-aware statistical timing analysis framework. In our framework, cell as well as interconnect delays are assumed to be correlated random variables. Our tool ...
173
click to vote
SSD
2009
Springer
16 years 1 months ago
2009
Springer
ELKI is a uni ed software framework, designed as a tool suitable for evaluation of dierent algorithms on high dimensional realvalued feature-vectors. A special case of high dimens...
171
click to vote
COMPSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably, the most effective and broadest approach for adapti...