Sciweavers

963 search results - page 49 / 193
» On Computation of Performance Bounds of Optimal Index Assign...
Sort
View
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 3 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
ICCAD
2006
IEEE
108views Hardware» more  ICCAD 2006»
15 years 8 months ago
Soft error reduction in combinational logic using gate resizing and flipflop selection
Soft errors in logic are emerging as a significant reliability problem for VLSI designs. This paper presents novel circuit optimization techniques to mitigate soft error rates (SE...
Rajeev R. Rao, David Blaauw, Dennis Sylvester
DAC
2009
ACM
15 years 4 months ago
GPU-based parallelization for fast circuit optimization
The progress of GPU (Graphics Processing Unit) technology opens a new avenue for boosting computing power. This work is an attempt to exploit GPU for accelerating VLSI circuit opt...
Yifang Liu, Jiang Hu
JMLR
2006
107views more  JMLR 2006»
14 years 11 months ago
Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
Magnus Ekdahl, Timo Koski
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
15 years 6 months ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer