2924 search results - page 332 / 585 » Lower Bounds in Distributed Computing |
120
click to vote
NOSSDAV
2009
Springer
15 years 11 months ago
2009
Springer
Peer-assisted online storage and distribution systems have recently enjoyed large-scale deployment gaining increased popularity for multimedia content sharing in the Internet. Suc...
126
click to vote
DSN
2005
IEEE
15 years 10 months ago
2005
IEEE
Fault-tolerant protocols, asynchronous and synchronous alike, make stationary fault assumptions: only a fraction f of the total n nodes may fail. Whilst a synchronous protocol is ...
148
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
150
click to vote
RTSS
1992
IEEE
15 years 8 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
134
Voted
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...