Results 11 to 20 of about 4,184,946 (299)
Randomized Average Kaczmarz Algorithm for Tensor Linear Systems
For solving tensor linear systems under the tensor–tensor t-product, we propose the randomized average Kaczmarz (TRAK) algorithm, the randomized average Kaczmarz algorithm with random sampling (TRAKS), and their Fourier version, which can be effectively ...
Wendi Bao +4 more
doaj +2 more sources
A Randomized Algorithm for Optimal PID Controllers
A randomized algorithm is suggested for the syntheses of optimal PID controllers for MIMO coupled systems, where the optimality is with respect to the H ∞ -norm, the H 2 -norm and the LQR functional, with possible system-performance ...
Yossi Peretz
doaj +2 more sources
Randomized block coordinate DC algorithm
We introduce an extension of the Difference of Convex Algorithm (DCA) in the form of a randomized block coordinate approach for problems with separable structure.
Hoomaan Maskan +3 more
doaj +2 more sources
Correctness Proof of Ben-Or's Randomized Consensus Algorithm [PDF]
We present a correctness proof for Ben-Or's Randomized Consensus Algorithm for the case in which processes can fail by crashing, and a majority of processes is correct.
Aguilera, Marcos Kawazoe, Toueg, Sam
core +6 more sources
Cryptography and Algorithmic Randomness [PDF]
34 pages, LaTeX2e, no ...
Kohtaro Tadaki, Norihisa Doi
openaire +3 more sources
Quantum algorithmic randomness [PDF]
Quantum Martin-Löf randomness (q-MLR) for infinite qubit sequences was introduced by Nies and Scholz [J. Math. Phys. 60(9), 092201 (2019)]. We define a notion of quantum Solovay randomness, which is equivalent to q-MLR. The proof of this goes through a purely linear algebraic result about approximating density matrices by subspaces.
openaire +2 more sources
Generalized reordering buffer management [PDF]
An instance of the generalized reordering buffer management problem consists of a service station that has k servers, each configured with a color, and a buffer of size b. The station needs to serve an online stream of colored items.
Yossi Azar +7 more
core +1 more source
Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem [PDF]
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Darby-Dowman, K +7 more
core +1 more source
Randomized Parameterized Algorithms for the Kidney Exchange Problem
In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries.
Mugang Lin +3 more
doaj +1 more source
Probabilistic Algorithmic Randomness
AbstractWe introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness.
Sam Buss, Mia Minnes
openaire +2 more sources

