Results 21 to 30 of about 1,313,618 (334)
Distributed GNE-Seeking under Partial Information Based on Preconditioned Proximal-Point Algorithms
This paper proposes a distributed algorithm for games with shared coupling constraints based on the variational approach and the proximal-point algorithm.
Zhongzheng Wang +5 more
doaj +1 more source
Simulating Wde-area Replication [PDF]
We describe our experiences with simulating replication algorithms for use in far flung distributed systems. The algorithms under scrutiny mimic epidemics. Epidemic algorithms seem to scale and adapt to change (such as varying replica sets) well.
Mullender, Sape J. +1 more
core +3 more sources
Distributed algorithms for sensor networks [PDF]
Distributed algorithms are an established tool for designing protocols for sensor networks. In this paper, we discuss the relation between distributed computing theory and sensor network applications. We also present a few basic and illustrative distributed algorithms.
Lenzen Christoph, Wattenhofer Roger
openaire +3 more sources
In this work we focus on the energy efficiency challenge in wireless sensor networks, from both an on-line perspective (related to routing), as well as a network design perspective (related to tracking).
Paul G. Spirakis, Sotiris Nikoletseas
doaj +1 more source
Fed‐SAD: A secure aggregation federated learning method for distributed short‐term load forecasting
The distributed and privacy‐preserving attributes of fine‐grained smart grid data create obstacles to data sharing. As a result, federated learning emerges as an effective strategy for collaborative training in distributed load forecasting.
Hexiao Li +4 more
doaj +1 more source
Performance Guarantees for Distributed Reachability Queries [PDF]
In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs.
Fan, Wenfei, Wang, Xin, Wu, Yinghui
core +2 more sources
Distributed Phase Estimation Algorithm and Distributed Shor's Algorithm
Shor's algorithm is one of the most significant quantum algorithms. Shor's algorithm can factor large integers with a certain success probability in polynomial time. However, Shor's algorithm requires an unbearable amount of qubits in the NISQ (Noisy Intermediate-scale Quantum) era.
Xiao, Ligang +3 more
openaire +2 more sources
Distributed quantum computing: a distributed Shor algorithm [PDF]
We present a distributed implementation of Shor's quantum factoring algorithm on a distributed quantum network model. This model provides a means for small capacity quantum computers to work together in such a way as to simulate a large capacity quantum computer.
Yimsiriwattana, Anocha +1 more
openaire +2 more sources
Simple Synchronous and Asynchronous Algorithms for Distributed Minimax Optimization
Synchronous and asynchronous algorithms are presented for distributed minimax optimization. The objective here is to realize the minimization of the maximum of component functions over the standard multi-agent network, where each node of the network ...
Kenta Hanada +3 more
doaj +1 more source
Improved Distributed Algorithms for Exact Shortest Paths
Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et ...
A +3 more
core +1 more source

