Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
Abstract— This paper studies the effect of communicationlink weighting schemes and long-range connections in speeding convergence to consensus on the average of the inputs to age...
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R....
This paper develops algorithms to train support vector machines when training data are distributed across different nodes, and their communication to a centralized processing unit...
Pedro A. Forero, Alfonso Cano, Georgios B. Giannak...