On the Selection of Information Sources for Gossip Spreading by Wenxiang Dong, Ying Yang, Wenyi Zhang

“…Experiments are carried out to study the spreading performance, illustrating the significant superiority of the greedy algorithm over heuristic and random algorithms.…”
Get full text

Conic sampling: an efficient method for solving linear and quadratic programming by randomly linking constraints within the interior. by Oliver Serang

“…Existing approaches to LP have been dominated by a small group of methods, and randomized algorithms have not enjoyed popularity in practice. …”
Get full text

FPGA-Based System for Electromagnetic Interference Evaluation in Random Modulated DC/DC Converters by Hermes Loschi, Piotr Lezynski, Robert Smolenski, Douglas Nascimento, Wojciech Sleszynski

“…Probability density functions (PDF) are used to analyse and improve pseudo-random algorithms. The theoretical algorithms, hardware details and experimental results are presented and discussed in terms of conducted electromagnetic interference emission.…”
Get full text

Fast principal component analysis of large-scale genome-wide data. by Gad Abraham, Michael Inouye

“…We have developed flashpca, a highly efficient PCA implementation based on randomized algorithms, which delivers identical accuracy in extracting the top principal components compared with existing tools, in substantially less time. …”
Get full text

ioco theory for probabilistic automata by Marcus Gerhold, Mariëlle Stoelinga

“…Probability plays a role in many different systems: unreliable communication channels, randomized algorithms and communication protocols, service level agreements pinning down up-time percentages, etc. …”
Get full text

Refined Probabilistic Abstraction by Wachter, B

“…Meaningful guarantees are typically of a probabilistic nature due to the use of randomized algorithms inside network protocols and other phenomena like message loss. …”

Unbounded lower bound for k-server against weak adversaries by Bienkowski, M, Byrka, J, Coester, C, Jeż, L

“…Our lower bound holds for both deterministic and randomized algorithms. It also disproves the existence of a competitive algorithm for the infinite server problem on general metrics.…”

Cross Tensor Approximation Methods for Compression and Dimensionality Reduction by Salman Ahmadi-Asl, Cesar F. Caiafa, Andrzej Cichocki, Anh Huy Phan, Toshihisa Tanaka, Ivan Oseledets, Jun Wang

“…This paper reviews and extends state-of-the-art deterministic and randomized algorithms for CTA with intuitive graphical illustrations. …”
Get full text

Probabilistic guarded commands mechanized in HOL by Hurd, J, McIver, A, Morgan, C

“…<p>The probabilistic guarded-command language (<em>pGCL</em>) contains both demonic and probabilistic non-determinism, which makes it suitable for reasoning about distributed random algorithms. Proofs are based on weakest precondition semantics, using an underlying logic of real- (rather than Boolean-) valued functions.…”

Gravitation-Based 3-D Redeployment Schemes for the Mobile Sensors and Sink in Gas Leakage Monitoring by He Li, Yang Yang, Xuesong Qiu, Zhipeng Gao, Guizhen Ma

“…The simulation results show that the GRSS and PRSS methods can achieve better coverage and utilize less distance compared with the random algorithm and 3-D self-deployment.…”
Get full text

Randomized Distributed Mean Estimation: Accuracy vs. Communication by Jakub Konečný, Peter Richtárik, Peter Richtárik, Peter Richtárik

“…We propose a flexible family of randomized algorithms exploring the trade-off between expected communication cost and estimation error. …”
Get full text

Multi-task offloading scheme for UAV-enabled fog computing networks by Xujie Li, Lingjie Zhou, Ying Sun, Buyankhishig Ulziinyam

“…Finally, simulation results show that the performance of a proposed scheduling algorithm and offloading strategy outperforms than that of a genetic algorithm and a random algorithm. This result can provide an effective optimization for multi-task offloading in UAV-enabled fog computing networks.…”
Get full text

Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order k by Maciej Goćwin, Marek Szczęsny

“…Comparing the obtained bounds with results known in the deterministic case, we see that randomized algorithms give us a speed-up by \(1/2\), and quantum algorithms by \(1\) in the exponent. …”
Get full text

Diagnostics on the cost-function in variational assimilations for meteorological models by Y. Michel

“…It is shown that the randomization algorithm proposed in the literature can be extended to cover these computations, yet at the price of additional minimizations. …”
Get full text

Technology-enhanced learning (TEL) of finite state machines (FSMs) by Ling, Ping Liang

“…By implementing randomization algorithm in the question generation, a large pool of questions can be set for learner to try out. …”
Get full text

Self-similar network traffic using Successive Random Addition (SRA) algorithm / Hani Hamira Harun by Harun, Hani Hamira

“…In this project, we have used the Successive random algorithm (SRA). Then, we have decided to use Variance time plot and R/S statistics as our statistical analysis tools. …”
Get full text

False-Name Manipulations in Weighted Voting Games by Aziz, H, Bachrach, Y, Elkind, E, Paterson, M

“…We then show that checking whether a beneficial split exists is NP-hard, and discuss efficient algorithms for restricted cases of this problem, as well as randomized algorithms for the general case. We also provide an experimental evaluation of these algorithms. …”

A Risk Management Approach to Double-Virus Tradeoff Problem by Jichao Bi, Fangfei Zhang, Ali Dorri, Chunming Zhang, Chen Zhang

“…Then, we propose a DOWNHILL algorithm, three heuristic algorithms and a random algorithm to solve the problem, respectively. We study the computational complexities of the proposed algorithms as well. …”
Get full text

The use of hyperspectral remote sensing for mapping the age composition of forest stands by O. Skoupý, L. Zejdová, J. Hanuš

“…It studies possibilities of a more detailed age estimation of stand groups aged from 10 to 80 years based on the classification into the boundary classes, which shows similarity to dithering based on random algorithm. Comparison with the outline map of the Forest Management Plan shows a correlation (r2 = 0.83) between the spectral characteristics of Norway spruce stands and their age composition.…”
Get full text

Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time by Ghaffari, Mohsen, Grunau, Christoph

Get full text