5448 search results - page 172 / 1090 » Breakpoints and Time in Distributed Computations |
117
click to vote
SOFSEM
1997
Springer
15 years 8 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
163
click to vote
TRIDENTCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Deploying and controlling experiments running on a distributed set of resources is a challenging task. Software developers often spend a significant amount of time dealing with the...
140
click to vote
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
This article describes a new model of probability density function and its use in estimation of distribution algorithms. The new model, the distribution tree, has interesting prope...
126
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
106
click to vote
SC
2009
ACM
15 years 11 months ago
2009
ACM
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...