6105 search results - page 177 / 1221 » A Parallel Algorithm for Bound-Smoothing |
267
click to vote
AES
2011
Springer
14 years 6 months ago
2011
Springer
We propose a model for describing and predicting the parallel performance of a broad class of parallel numerical software on distributed memory architectures. The purpose of this ...
158
click to vote
COLING
2002
15 years 6 months ago
2002
The paper presents a statistical approach to automatic building of translation lexicons from parallel corpora. We briefly describe the pre-processing steps, a baseline iterative m...
258
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
282
Voted
ICDCN
2011
Springer
14 years 9 months ago
2011
Springer
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
