Sciweavers

5244 search results - page 10 / 1049
» When are two algorithms the same
Sort
View
OPODIS
2008
13 years 9 months ago
Solving Atomic Multicast When Groups Crash
In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non...
Nicolas Schiper, Fernando Pedone
GROUP
2010
ACM
13 years 5 months ago
Design, implementation, and evaluation of an approach for determining when programmers are having difficulty
Previous research has motivated the idea of automatically determining when programmers are having difficulty, provided an initial algorithm (unimplemented in an actual system), an...
Jason Carter, Prasun Dewan
USS
2008
13 years 10 months ago
On Auditing Elections When Precincts Have Different Sizes
We address the problem of auditing an election when precincts may have different sizes. Prior work in this field has emphasized the simpler case when all precincts have the same s...
Javed A. Aslam, Raluca A. Popa, Ronald L. Rivest
PDCAT
2007
Springer
14 years 1 months ago
Two Tree-Based Algorithms for Network Spare Capacity Design
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan...
ICMLA
2004
13 years 9 months ago
Two new regularized AdaBoost algorithms
AdaBoost rarely suffers from overfitting problems in low noise data cases. However, recent studies with highly noisy patterns clearly showed that overfitting can occur. A natural s...
Yijun Sun, Jian Li, William W. Hager