14 papers · ranked by Valyu relevance
Matthias Volk, Borzoo Bonakdarpour, Joost-Pieter Katoen, Saba Aflaki
Randomization is a key concept in distributed computing to tackle impossibility results. This also holds for self-stabilization in anonymous networks where coin flips are often used to break symmetry. Although the use of randomization in self-stabilizing algorithms is rather common, it is unclear what the optimal coin…
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
Explorable heap selection is the problem of selecting the nth smallest value in a binary heap. The key values can only be accessed by traversing through the underlying infinite binary tree, and the complexity of the algorithm is measured by the total distance traveled in the tree (each edge has unit cost). This problem…
Muhammad Ayyaz Tariq, Muhammad Salman Fakhar, Ghulam Abbas, Syed Abdul Rahman Kashif + 3 more
'Syed Abdul Rahman Kashif' 'Ateeq Ur Rehman' 'Khmaies Ouahada' 'Habib Hamam'] A random initialization of the search particles is a strong argument in favor of the deployment of nature-inspired metaheuristic algorithms when the knowledge of a good initial guess is lacked. This article analyses the impact of the type of…
Mengqi Zhang, Guangqiang Teng, Xiaoyu Lei, Boris Ryabko
Lei proposed an algorithm Algorithm $A_{3}$ in 2023 to generate an exact discrete uniform distribution from an unknown biased Bernoulli source. The present paper does not claim a new extraction algorithm. Its contributions are analytical: first, we provide a Fourier-analytic proof of the uniformity mechanism based on…
Daniel Ahfock, William J. Astle, Sylvia Richardson
There is an increasing body of work exploring the integration of random projection into algorithms for numerical linear algebra. The primary motivation is to reduce the overall computational cost of processing large datasets. A suitably chosen random projection can be used to embed the original dataset in a…
Ran Zhang, Xiaohan Li, Caihua Wan, Raik Hoffmann + 14 more
Combinatorial optimization underpins applications in artificial intelligence, logistics, and network design, yet classical techniques such as greedy search and dynamic programming struggle to balance efficiency and solution quality at scale. We present a probabilistic framework that embeds true random number generators…
Yuyong Tan, Jianfeng Wang, Bin Wang, Yongquan Zhou
The intelligent optimization algorithm has become a key tool in complex and intertwined engineering and science fields. However, with the increasing complexity of the problem and the rapid expansion of the data scale, the performance of the algorithm has been challenged unprecedentedly. The artificial lemming algorithm…
Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley + 1 more
'Rudy Zhou'] The configuration balancing problem with stochastic requests generalizes well-studied resource allocation problems such as load balancing and virtual circuit routing. There are given m resources and n requests; each request has multiple possible configurations, each of which increases the load of each…
Kiyoshiro Okada, Katsuhiro Endo, Kenji Yasuoka, Shuichi Kurabayashi + 1 more
'Sheetal Kalyani'] Pseudo-random number generators (PRNGs) are software algorithms generating a sequence of numbers approximating the properties of random numbers. They are critical components in many information systems that require unpredictable and nonarbitrary behaviors, such as parameter configuration in machine…
Oleksandr Sverdlov, Yevgen Ryeznik, Volodymyr Anisimov, Olga M. Kuznetsova + 4 more
'Olga M. Kuznetsova' 'Ruth Knight' 'Kerstine Carter' 'Sonja Drescher' 'Wenle Zhao'] Background The design of a multi-center randomized controlled trial (RCT) involves multiple considerations, such as the choice of the sample size, the number of centers and their geographic location, the strategy for recruitment of…
Muhammad Azeem, Javid Shabbir, Najma Salahuddin, Sundus Hussain + 2 more
In social surveys, the randomized response technique can be considered a popular method for collecting reliable information on sensitive variables. Over the past few decades, it has been a common practice that survey researchers develop new randomized response techniques and show their improvement over previous models.…
Ahmed A. Al-Jaishi, Monica Taljaard, Melissa D. Al-Jaishi, Sheikh S. Abdullah + 4 more
'Sheikh S. Abdullah' 'Lehana Thabane' 'P. J. Devereaux' 'Stephanie N. Dixon' 'Amit X. Garg'] Background Cluster randomized trials (CRTs) are becoming an increasingly important design. However, authors of CRTs do not always adhere to requirements to explicitly identify the design as cluster randomized in titles and…
Cameron Foreman, Richie Yeung, Florian J. Curchod, Andrei Khrennikov + 1 more
'Karl Svozil'] Random number generators (RNGs) are notoriously challenging to build and test, especially for cryptographic applications. While statistical tests cannot definitively guarantee an RNG’s output quality, they are a powerful verification tool and the only universally applicable testing method. In this work…
Abdul Kader Kassoumeh, Zühal Kartal, Ahmet Arslan, Dragan Pamucar
This article introduces methods for initializing a single-trajectory-based metaheuristic, specifically a simulated annealing (SA) algorithm, using constructive heuristics. These methods are designed to target promising regions within the search space of an nondeterministic polynomial time (NP)-hard problem, namely the…