Sciweavers

1074 search results - page 142 / 215
» Parallelizing post-placement timing optimization
Sort
View
ICEIS
2009
IEEE
14 years 3 months ago
Vectorizing Instance-Based Integration Processes
Abstract. The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiti...
Matthias Böhm, Dirk Habich, Steffen Preissler...
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
14 years 3 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
COMPGEOM
1993
ACM
14 years 1 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
NIPS
1996
13 years 10 months ago
Interpreting Images by Propagating Bayesian Beliefs
A central theme of computational vision research has been the realization that reliable estimation of local scene properties requires propagating measurements across the image. Ma...
Yair Weiss
SIAMSC
2008
151views more  SIAMSC 2008»
13 years 9 months ago
Accurate Floating-Point Summation Part I: Faithful Rounding
Given a vector of floating-point numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s, i.e. the result is one of the immediate floating-point ...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi