Sciweavers

279 search results - page 40 / 56
» Reduction approaches for robust shortest path problems
Sort
View
84
Voted
WSNA
2003
ACM
15 years 2 months ago
Parametric probabilistic sensor network routing
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
Christopher L. Barrett, Stephan Eidenbenz, Lukas K...
70
Voted
ISCA
2010
IEEE
340views Hardware» more  ISCA 2010»
15 years 2 months ago
Necromancer: enhancing system throughput by animating dead cores
Aggressive technology scaling into the nanometer regime has led to a host of reliability challenges in the last several years. Unlike onchip caches, which can be efficiently prot...
Amin Ansari, Shuguang Feng, Shantanu Gupta, Scott ...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
15 years 9 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
SIGMETRICS
2011
ACM
229views Hardware» more  SIGMETRICS 2011»
14 years 14 days ago
Model-driven optimization of opportunistic routing
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...
Eric Rozner, Mi Kyung Han, Lili Qiu, Yin Zhang
75
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
FIT: fast Internet traceback
— Traceback mechanisms are a critical part of the defense against IP spoofing and DoS attacks, as well as being of forensic value to law enforcement. Currently proposed IP trace...
Abraham Yaar, Adrian Perrig, Dawn Xiaodong Song