Sciweavers

2814 search results - page 45 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
PODS
2012
ACM
276views Database» more  PODS 2012»
12 years 10 days ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
ICASSP
2009
IEEE
14 years 4 months ago
A mixed time-scale algorithm for distributed parameter estimation : Nonlinear observation models and imperfect communication
Abstract— The paper considers the algorithm NLU for distributed (vector) parameter estimation in sensor networks, where, the local observation models are nonlinear, and inter-sen...
Soummya Kar, José M. F. Moura
IJCAI
1989
13 years 11 months ago
Parallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, an...
Shie-rei Huang, Larry S. Davis
SSS
2009
Springer
14 years 4 months ago
Stability of Distributed Algorithms in the Face of Incessant Faults
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
Robert E. Lee DeVille, Sayan Mitra
FOCS
2002
IEEE
14 years 2 months ago
Minimizing Congestion in General Networks
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...
Harald Räcke