3483 search results - page 395 / 697 » Forward |
179
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—In wireless sensor networks, asynchronous sleepwake scheduling protocols can significantly reduce energy consumption without incurring the communication overhead for cl...
164
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of nex...
183
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
184
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
160
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Clustering ensembles combine different clustering solutions into a single robust and stable one. Most of existing methods become highly time-consuming when the data size turns to ...