1612 search results - page 151 / 323 » Analysing Randomized Distributed Algorithms |
153
click to vote
WSDM
2009
ACM
15 years 12 months ago
2009
ACM
The Web is a dynamic, ever changing collection of information. This paper explores changes in Web content by analyzing a crawl of 55,000 Web pages, selected to represent different...
152
click to vote
MOBIHOC
2007
ACM
16 years 4 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
198
click to vote
ESA
2007
Springer
15 years 9 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
141
click to vote
AAIM
2007
Springer
15 years 9 months ago
2007
Springer
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
132
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...