Sciweavers

2814 search results - page 265 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
CSDA
2007
136views more  CSDA 2007»
15 years 12 days ago
A note on iterative marginal optimization: a simple algorithm for maximum rank correlation estimation
The maximum rank correlation (MRC) estimator was originally studied by Han [1987. Nonparametric analysis of a generalized regression model. J. Econometrics 35, 303–316] and Sher...
Hansheng Wang
122
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
Bo Han, Weijia Jia
116
Voted
IEEEARES
2006
IEEE
15 years 6 months ago
Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
Matthew Leslie, Jim Davies, Todd Huffman
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 20 days ago
Adaptive Dynamics of Realistic Small-World Networks
Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search, we conduct an experimental analysis of destination sampling, a dynamic algorithm...
Olof Mogren, Oskar Sandberg, Vilhelm Verendel, Dev...
JNW
2006
145views more  JNW 2006»
15 years 16 days ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman