2924 search results - page 155 / 585 » Lower Bounds in Distributed Computing |
101
click to vote
TEC
2010
14 years 7 months ago
2010
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
156
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
117
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
95
Voted
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...