173 search results - page 35 / 35 » The Fastest and Shortest Algorithm for All Well-Defined Prob... |
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
BMCBI
2005
13 years 4 months ago
2005
Abstract. Taxonomy provides one of the most powerful ways to navigate sequence data bases but currently, users are forced to formulate queries according to a single taxonomic class...
DIALM
2003
ACM
13 years 10 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...