1095 search results - page 159 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
135
Voted
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 2 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
111
click to vote
IPPS
2010
IEEE
15 years 12 days ago
2010
IEEE
Abstract--Nodes within existing P2P networks typically exchange periodic keep-alive messages in order to maintain network connections between neighbours. Keep-alive messages serve ...
154
Voted
VECPAR
2004
Springer
15 years 7 months ago
2004
Springer
Binomial trees have been used extensively for broadcasting in clusters of workstations. In the case of heterogeneous nondedicated clusters and grid environments, the broadcasting o...
125
click to vote
CONCUR
2000
Springer
15 years 6 months ago
2000
Springer
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
109
Voted
ICCCN
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...