Results 11 to 20 of about 1,301,602 (288)
Parameterized Distributed Algorithms [PDF]
CoRR, 2018 In this work, we initiate a thorough study of graph optimization problems parameterized by the output size in the distributed setting. In such a problem, an algorithm decides whether a solution of size bounded by k exists and if so, it finds one.
Ben-Basat, Ran +2 more
core +5 more sources
Optimal Distributed Covering Algorithms [PDF]
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019 We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank f. This problem is equivalent to the Minimum Weight Set Cover problem in which the frequency of every element is bounded ...
Ben-Basat, Ran +3 more
core +8 more sources
On the robustness of distributed algorithms [PDF]
Proceedings of the 45th IEEE Conference on Decision and Control, 2006 In recent years, numerous distributed algorithms have been proposed which, when executed by a team of dynamic agents, result in the completion of a joint task. However, for any such algorithm to be practical, one should be able to guarantee that the task is still satisfactorily executed even when agents fail to communicate with others or to perform ...
Vijay Gupta 0001 +2 more
openaire +2 more sources
Distributed Systems and Algorithms [PDF]
, 2010 Despite an impressive body of research, parallel and distributed computing remains a complex task prone to subtle software issues that can affect both the correctness and the performance of the computation. The increasing demand to distribute computing over large-scale parallel and distributed platforms, such as grids and large clusters, often combined
Omer F. Rana +3 more
openaire +6 more sources
Quantum Information and Computation, 2023 Shor's algorithm is one of the most important quantum algorithm proposed by Peter Shor [Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 124--134]. Shor's algorithm can factor a large integer with certain probability and costs polynomial time in the length of the input integer.
Ligang Xiao +3 more
openaire +2 more sources
The distributed boosting algorithm [PDF]
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, 2001 In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneous databases that cannot be merged at a single location. Our distributed boosting algorithm can also be used as a parallel classification technique, where a massive database ...
Aleksandar Lazarevic, Zoran Obradovic
openaire +1 more source
Adaptive Geman-McClure Estimator for Robust Distributed Channel Estimation
IEEE Access, 2021 Communication systems are affected by channel distortions. Impulsive noise is one of the significant factors for channel impairments. The standard additive white Gaussian noise (AWGN) channel model and conventional estimation algorithms like least mean ...
Annet Mary Wilson +3 more
doaj +1 more source
Micromachines, 2016 Stochastic self-assembly provides promising means for building micro-/nano-structures with a variety of properties and functionalities. Numerous studies have been conducted on the control and modeling of the process in engineered self-assembling systems ...
Bahar Haghighat +4 more
doaj +1 more source
Distributed Solution of Road Lighting Problem Over Multi-Agent Networks
Sakarya University Journal of Computer and Information Sciences, 2020 In this study, we consider the solution of the road lighting problem by distributed algorithms over multi-agent networks where the objective is to determine the powers of the lamps that provide the desired road lighting level for a given road profile ...
Onur Cihan
doaj +1 more source
Distributed Graph Automata and Verification of Distributed Algorithms [PDF]
, 2014 Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic.
Reiter, Fabian
core +1 more source