126 search results - page 10 / 26 » The cost of fault tolerance in multi-party communication com... |
DSN
2006
IEEE
14 years 1 months ago
2006
IEEE
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
AICCSA
2008
IEEE
13 years 7 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
TDSC
2011
13 years 2 months ago
2011
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...
HASE
2008
IEEE
14 years 2 months ago
2008
IEEE
With the increasing complexity in software and electronics in safety-critical systems new challenges to lower the costs and decrease time-to-market, while preserving high assuranc...
NGC
2000
Springer
13 years 11 months ago
2000
Springer
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...