Results 61 to 70 of about 1,291,560 (184)

Distributed algorithms from arboreal ants for the shortest path problem. [PDF]

Proc Natl Acad Sci U S A, 2023
Garg S, Shiragur K, Gordon DM, Charikar M.   +3 more
europepmc   +1 more source

Optimized byzantine fault tolerant algorithm for improving performance and security with trust values

IET Blockchain
Blockchain is considered to be a promising technology due to its decentralization, open, and non tamperation. Nevertheless, the current blockchain system cannot replace traditional financial institutions because its performance and security indicators in
Linqing Xiao, Juntao Gao, Baocang Wang, Xuelian Li   +3 more
doaj   +1 more source

Computing Fault-Containment Times of Self-Stabilizing Algorithms Using Lumped Markov Chains

Algorithms, 2018
The analysis of self-stabilizing algorithms is often limited to the worst case stabilization time starting from an arbitrary state, i.e., a state resulting from a sequence of faults.
Volker Turau
doaj   +1 more source

Distributed Grover's algorithm

Theoretical Computer Science
20pages, five figures, comments are ...
Qiu, Daowen, Luo, Le, Xiao, Ligang
openaire   +2 more sources

JSDoop and TensorFlow.js: Volunteer Distributed Web Browser-Based Neural Network Training

IEEE Access, 2019
In 2019, around 57% of the population of the world has broadband access to the Internet. Moreover, there are 5.9 billion mobile broadband subscriptions, i.e., 1.3 subscriptions per user.
Jose A. Morell, Andres Camero, Enrique Alba   +2 more
doaj   +1 more source

Bilinear Expectation Propagation for Distributed Semi-Blind Joint Channel Estimation and Data Detection in Cell-Free Massive MIMO

IEEE Open Journal of Signal Processing
We consider a cell-free massive multiple-input multiple-output (CF-MaMIMO) communication system in the uplink transmission and propose a novel algorithm for blind or semi-blind joint channel estimation and data detection (JCD).
Alexander Karataev, Christian Forsch, Laura Cottatellucci   +2 more
doaj   +1 more source

Collective search by ants in microgravity

Frontiers in Ecology and Evolution, 2015
The problem of collective search is a tradeoff between searching thoroughly and covering as much area as possible. This tradeoff depends on the density of searchers. Solutions to the problem of collective search are currently of much interest in robotics
Stefanie M. Countryman, Martin C. Stumpe, Sam P. Crow, Frederick R. Adler, Michael John Greene, Merav eVonshak, Deborah M. Gordon   +6 more
doaj   +1 more source

Constrained distributed online convex optimization with bandit feedback for unbalanced digraphs

IET Control Theory & Applications
In this study, a distributed primal‐dual bandit feedback method for online convex optimization with time‐varying coupled inequality constraints on unbalanced directed graphs is proposed.
Keishin Tada, Naoki Hayashi, Shigemasa Takai   +2 more
doaj   +1 more source

ACapDS: An Energy-Efficient and Fault-Tolerant Distributed Capacitated Dominating Set Algorithm for Industrial IoT

IEEE Access
Design and analysis of energy-efficient and fault-tolerant dominating set (DS) algorithms are vital tasks for Industrial Internet of Things (IIoT) scenarios, as operational efficiency is a key objective in most industries.
Ozkan Arapoglu, Umut Can Cabuk, Orhan Dagdeviren, Moharram Challenger   +3 more
doaj   +1 more source

Randomized algorithms for distributed computation of principal component analysis and singular value decomposition

, 2018
Randomized algorithms provide solutions to two ubiquitous problems: (1) the distributed calculation of a principal component analysis or singular value decomposition of a highly rectangular matrix, and (2) the distributed calculation of a low-rank ...
Kluger, Yuval, Li, Huamin, Tygert, Mark
core