On the Average Communication Complexity of Asynchronous Distributed Algorithms.
John N. TsitsiklisGeorge D. StamoulisPublished in: J. ACM (1995)
Keyphrases
- computational complexity
- worst case
- space complexity
- computational cost
- learning algorithm
- data structure
- machine learning algorithms
- asynchronous communication
- communication overhead
- data mining algorithms
- orders of magnitude
- significant improvement
- multi agent
- theoretical analysis
- computationally efficient
- distributed systems
- memory requirements
- computing environments
- optimization problems
- multi party
- high computational complexity
- distributed computation