We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...
Abstract—In this paper, we propose and evaluate two distributed protocols for finding low-cost broadcast and multicast trees in wireless networks. The constructed trees can then...
Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fek...
Abstract—We consider the location service in a mobile adhoc network (MANET), where each node needs to maintain its location information in the network by (i) frequently updating ...
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
—Using directional antennas to conserve bandwidth and energy consumption in ad hoc wireless networks has attracted much attention of the research community in recent years. Howev...