2374 search results - page 156 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
140
Voted
HIPC
2009
Springer
15 years 8 days ago
2009
Springer
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
137
click to vote
PPSN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
123
click to vote
EUROPAR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more comple...
114
click to vote
PDCAT
2005
Springer
15 years 8 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
237
click to vote
ICDE
2000
IEEE
16 years 3 months ago
2000
IEEE
Most decision tree classifiers are designed to keep class histograms for single attributes, and to select a particular attribute for the next split using said histograms. In this ...