460 search results - page 41 / 92 » Bounding the locality of distributed routing algorithms |
WCW
2004
Springer
14 years 2 months ago
2004
Springer
Distributed hash tables are increasingly being proposed as the core substrate for content delivery applications in the Internet, such as cooperative Web caches, Web index and sear...
ICPP
2006
IEEE
14 years 3 months ago
2006
IEEE
— Due to resource scarcity, a paramount concern in ad hoc networks is to utilize the limited resources efficiently. The self-organized nature of ad hoc networks makes the social...
ALT
2010
Springer
13 years 10 months ago
2010
Springer
We further develop the idea that the PAC-Bayes prior can be informed by the data-generating distribution. We prove sharp bounds for an existing framework of Gibbs algorithms, and ...
TCC
2009
Springer
14 years 9 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
SKG
2006
IEEE
14 years 3 months ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...