Sciweavers

633 search results - page 33 / 127
» Locality and Hard SAT-Instances
Sort
View
CASES
2011
ACM
14 years 6 months ago
Cost-effective safety and fault localization using distributed temporal redundancy
Cost pressure is driving vendors of safety-critical systems to integrate previously distributed systems. One natural approach we have previous introduced is On-Demand Redundancy (...
Brett H. Meyer, Benton H. Calhoun, John Lach, Kevi...
MOBIHOC
2005
ACM
16 years 5 months ago
A secure ad-hoc routing approach using localized self-healing communities
Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protoco...
Jiejun Kong, Xiaoyan Hong, Yunjung Yi, Joon-Sang P...
AINA
2007
IEEE
16 years 13 days ago
An Adaptive Localized Algorithm for Multiple Sensor Area Coverage
— Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of t...
Antoine Gallais, Jean Carle
PODC
2005
ACM
15 years 11 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CIKM
2004
Springer
15 years 11 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel