2168 search results - page 34 / 434 » Randomized Algorithms and Complexity Theory |
TCS
1998
14 years 11 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
JDA
2008
14 years 11 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
117
click to vote
MST
2006
14 years 11 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
97
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...