153 search results - page 12 / 31 » An experimental study of greedy routing algorithms |
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
ADHOCNOW
2007
Springer
15 years 5 months ago
2007
Springer
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
132
click to vote
OPODIS
2010
14 years 9 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
BMCBI
2008
14 years 11 months ago
2008
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
DAC
2007
ACM
16 years 7 days ago
2007
ACM
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...