4208 search results - page 279 / 842 » Challenges in Evaluating Distributed Algorithms |
134
click to vote
WDAG
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
169
click to vote
IFM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and ...
125
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
127
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
162
click to vote
CIKM
2008
Springer
15 years 7 months ago
2008
Springer
The skyline query, as an important operator in databases for multi-preference analysis and decision making, has received much attention recently due to its wide application backgr...