552 search results - page 48 / 111 » Lower bounds for dynamic connectivity |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
This paper studies the opinion dynamics model recently introduced by Hegselmann and Krause: (1) each agent in a group mantains a real number describing its opinion, (2) each agent ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
ICCAD
1997
IEEE
14 years 1 months ago
1997
IEEE
This paper presents an efficient approach to perform global interconnect sizing and spacing (GISS) for multiple nets to minimize interconnect delays with consideration of couplin...