7228 search results - page 474 / 1446 » From Algorithmic to Subjective Randomness |
233
click to vote
ICDCN
2011
Springer
14 years 10 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
215
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
170
click to vote
AINA
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
170
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— We consider packet transmission scheduling at the MAC-layer via adaptive backoff algorithms that are favorable in terms of queue occupancies in a wireless network. General netw...
160
click to vote
ICDCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...