Sciweavers

2863 search results - page 21 / 573
» Constructing minimum-interference networks
Sort
View
RECOMB
2005
Springer
16 years 1 months ago
Constructing a Smallest Refining Galled Phylogenetic Network
Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary his...
Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguy...
MOBIHOC
2008
ACM
16 years 26 days 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
MSWIM
2004
ACM
15 years 6 months ago
Energy map construction for wireless sensor network under a finite energy budget
A fundamental issue in the design of a wireless sensor network is to devise mechanisms to make efficient use of its energy, and thus, extend its lifetime. Due to the paramount imp...
Raquel A. F. Mini, Antonio Alfredo Ferreira Lourei...
ICCSA
2009
Springer
15 years 8 months ago
On a Construction of Short Digests for Authenticating Ad Hoc Networks
In pervasive ad-hoc networks, there is a need for devices to be able to communicate securely, despite the lack of apriori shared security associations and the absence of an infrast...
Khoongming Khoo, Ford-Long Wong, Chu-Wee Lim
WDAG
2001
Springer
107views Algorithms» more  WDAG 2001»
15 years 5 months ago
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
Lisa Higham, Zhiying Liang