2309 search results - page 259 / 462 » Efficient Topological Exploration |
178
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
174
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
189
click to vote
MOBIHOC
2001
ACM
16 years 6 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
181
click to vote
EWSN
2008
Springer
16 years 6 months ago
2008
Springer
We consider the problem of determining the transmission power assignment that maximizes the lifetime of a data-gathering wireless sensor network with stationary nodes and static tr...
198
click to vote
ADHOCNETS
2009
Springer
16 years 1 months ago
2009
Springer
Although IEEE 802.15.4 is being considered as a promising standard for low-cost low-power Wireless Sensor Networks (WSNs), several issues in the specification are still open. One o...