1649 search results - page 163 / 330 » A Stable Broadcast Algorithm |
159
click to vote
WDAG
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
171
click to vote
DIS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
227
click to vote
TMC
2008
15 years 6 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
189
click to vote
TSMC
2002
15 years 6 months ago
2002
By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set...
152
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...