Sciweavers

153 search results - page 11 / 31
» An experimental study of greedy routing algorithms
Sort
View
MONET
2006
102views more  MONET 2006»
14 years 9 months ago
Locating and Bypassing Holes in Sensor Networks
In real sensor network deployments, spatial distributions of sensors are usually far from being uniform. Such networks often contain regions without enough sensor nodes, which we ...
Qing Fang, Jie Gao, Leonidas J. Guibas
FPGA
2009
ACM
159views FPGA» more  FPGA 2009»
15 years 4 months ago
Choose-your-own-adventure routing: lightweight load-time defect avoidance
Aggressive scaling increases the number of devices we can integrate per square millimeter but makes it increasingly difficult to guarantee that each device fabricated has the inte...
Raphael Rubin, André DeHon
ATAL
2007
Springer
15 years 1 months ago
A reinforcement learning based distributed search algorithm for hierarchical peer-to-peer information retrieval systems
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
Haizheng Zhang, Victor R. Lesser
72
Voted
ATAL
2010
Springer
14 years 10 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
84
Voted
DIALM
2005
ACM
100views Algorithms» more  DIALM 2005»
14 years 11 months ago
On the pitfalls of geographic face routing
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...