Sciweavers

289 search results - page 17 / 58
» Simple COMA Node Implementations
Sort
View
ICDCS
2011
IEEE
12 years 8 months ago
Competitive and Fair Medium Access Despite Reactive Jamming
Abstract—Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often...
Andréa W. Richa, Christian Scheideler, Stef...
WWW
2005
ACM
14 years 9 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
TPDS
1998
73views more  TPDS 1998»
13 years 8 months ago
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
Ming-Jer Tsai, Sheng-De Wang
IEEECIT
2010
IEEE
13 years 7 months ago
Fuzzy Location Service for Mobile Ad Hoc Networks
Abstract—Over the past years, location-based routing protocols have been studied extensively in mobile ad hoc networks (MANETs). However, how to efficiently provide the location ...
Yongming Xie, Guojun Wang, Jie Wu
AI
2006
Springer
14 years 17 days ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch