2498 search results - page 115 / 500 » Algorithms for the Topological Watershed |
173
click to vote
INFOCOM
2008
IEEE
16 years 17 days ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
139
click to vote
PADS
2006
ACM
16 years 3 days ago
2006
ACM
The development of realistic topology generators that produce faithful replicas of Internet topologies is critical for conducting realistic simulation studies of Internet protocol...
188
click to vote
CISS
2007
IEEE
16 years 15 days ago
2007
IEEE
— Wireless communication is a critical component of battlefield networks. Nodes in a battlefield network exist in hostile environments and thus fault-tolerance against node and...
155
click to vote
JPDC
2007
15 years 6 months ago
2007
If the variables used for a checkpointing algorithm have data faults, the existing checkpointing and recovery algorithms may fail. In this paper, self-stabilizing data fault detec...
222
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...