Sciweavers

1154 search results - page 85 / 231
» Adaptive Reliable Multicast
Sort
View
PODC
2010
ACM
13 years 10 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya
FTCS
1993
97views more  FTCS 1993»
13 years 10 months ago
Virtually-Synchronous Communication Based on a Weak Failure Suspector
Failure detectors (or, more accurately Failure Suspectors { FS) appear to be a fundamental service upon which to build fault-tolerant, distributed applications. This paper shows t...
André Schiper, Aleta Ricciardi
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
14 years 13 days ago
Towards effective adaptive random testing for higher-dimensional input domains
Adaptive Random Testing subsumes a class of algorithms that detect the first failure with less test cases than Random Testing. The present paper shows that a "reference metho...
Johannes Mayer
ICIAP
2007
ACM
14 years 9 months ago
An information theoretic rule for sample size adaptation in particle filtering
To become robust, a tracking algorithm must be able to support uncertainty and ambiguity often inherently present in the data in form of occlusion and clutter. This comes usually ...
Oswald Lanz
ASPDAC
2009
ACM
117views Hardware» more  ASPDAC 2009»
14 years 3 months ago
Adaptive techniques for overcoming performance degradation due to aging in digital circuits
— Negative Bias Temperature Instability (NBTI) in PMOS transistors has become a major reliability concern in present-day digital circuit design. Further, with the recent usage of...
Sanjay V. Kumar, Chris H. Kim, Sachin S. Sapatneka...