11 papers · ranked by Valyu relevance
Krasimir Yordzhev
Some randomized algorithms, used to obtain a random n 2 × n 2 Sudoku matrix, where n is a natural number, is reviewed in this study. Below is described the set Πn of all (2n) × n matrices, consisting of elements of the set Zn = {1, 2, . . . , n}, such that every row is a permutation. It is proved that such matrices…
James Aspnes
| | Table of contents | | | ii | | --- | --- | --- | --- | --- | | | List of figures | | | xiv | | | List of tables | | | xv | | | List of algorithms | | | xvi | | | Preface | | | xvii | | 1 | | Randomized algorithms | | 1 | | | 1.1 | A trivial example | | 2 | | | 1.2 | Verifying polynomial identities | | 3 | | | 1.3 |…
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…
Mahmood Saghaei
Background Typically, randomization software should allow users to exert control over the different aspects of randomization including block design, provision of unique identifiers and control over the format and type of program output. While some of these characteristics have been addressed by available software, none…
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…
Ben R Carter, Kerenza Hood
The allocation of the first block involves the full enumeration of each design. These are used to calculate an imbalance measure between treatment arm [Equation 1]. Each additional block was randomized conditional on the previously allocated design as a fixed starting point [Equation 2]. In doing so the algorithm not…
Bruno Salezze Vieira, Eduardo Machado Silva, Antônio Augusto Chaves
Scheduling Authors: ['Bruno Salezze Vieira' 'Eduardo Machado Silva' 'Antônio Augusto Chaves'] Efficient surgery room scheduling is essential for hospital efficiency, patient satisfaction, and resource utilization. This study addresses this challenge by introducing a novel concept of Random-Key Optimizer (RKO)…
Nevin Brackett‐Rozinsky, Daniel Lemire
Pseudorandom values are often generated as 64-bit binary words. These random words need to be converted into ranged values without statistical bias. We present an efficient algorithm to generate multiple independent uniformlyrandom bounded integers from a single uniformly-random binary word, without any bias. In the…
Daniel Lemire
In simulations, probabilistic algorithms and statistical tests, we often generate random integers in an interval (e.g., [0,s)). For example, random integers in an interval are essential to the Fisher-Yates random shuffle. Consequently, popular languages like Java, Python, C++, Swift and Go include ranged random integer…
James A. Bellamy
Randomness of binary sequences has been studied for a long time [1] and it continues to interest researchers because of the need to distinguish (in applicable situations) between randomness that has a classical basis from randomness that emerges out of quantum behavior. Random binary sequences are important not only in…
Hojong Choi, Seung-Hyeok Shin, Diego Martín, Masoud Kaveh + 1 more
'Mohammad Reza Mosavi'] Ultrasound systems have been widely used for consultation; however, they are susceptible to cyberattacks. Such ultrasound systems use random bits to protect patient information, which is vital to the stability of information-protecting systems used in ultrasound machines. The stability of the…