Near-Constant-Time Distributed Algorithms on a Congested Clique.

James W. Hegeman Sriram V. Pemmaraju Vivek Sardeshmukh

Published in: DISC (2014)

Keyphrases

computational cost
worst case
learning algorithm
multi agent
significant improvement
benchmark datasets
computational efficiency
distributed environment
machine learning
objective function
cooperative
computational complexity
lower bound
theoretical analysis
times faster
combinatorial optimization