Sciweavers

635 search results - page 28 / 127
» Localized Bridging Centrality for Distributed Network Analys...
Sort
View
CCR
1998
75views more  CCR 1998»
13 years 8 months ago
A comparative analysis of groupware application protocols
Two of the most difficult problems faced by developers of synchronous groupware applications are the handling of multiple session connections and the maintenance of replicated dat...
Mark Pendergast
ASUNAM
2011
IEEE
12 years 8 months ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
SOICT
2010
13 years 3 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
ADHOCNOW
2009
Springer
13 years 6 months ago
A Decentralized Approach to Minimum-Energy Broadcasting in Static Ad Hoc Networks
Broadcasting is a commonly used feature in wireless networking, e.g. for file distribution, re-tasking, event notification, or miscellaneous maintenance. Due to the limited resourc...
Christopher Miller, Christian Poellabauer
MOBIHOC
2008
ACM
14 years 8 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li