6251 search results - page 927 / 1251 » Randomness, Computability, and Density |
166
click to vote
MFCS
2001
Springer
15 years 12 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
201
click to vote
SPAA
1997
ACM
15 years 11 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
225
click to vote
DCOSS
2006
Springer
15 years 11 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
225
click to vote
ESA
1995
Springer
15 years 11 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
212
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...