Results 21 to 30 of about 2,824,860 (307)
Quantum algorithmic randomness [PDF]
Journal of Mathematical Physics, 2021 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
On Application of the Ray-Shooting Method for LQR via Static-Output-Feedback
Algorithms, 2018 In this article we suggest a randomized algorithm for the LQR (Linear Quadratic Regulator) optimal-control problem via static-output-feedback. The suggested algorithm is based on the recently introduced randomized optimization method called the Ray ...
Yossi Peretz
doaj +1 more source
Matching solid shapes in arbitrary dimension via random sampling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We give simple probabilistic algorithms that approximately maximize the volume of overlap of two solid, i.e. full-dimensional, shapes under translations and rigid motions. The shapes are subsets of $ℝ^d$ where $d≥ 2$.
Daria Schymura
doaj +1 more source
The Online Reservation Problem
Algorithms, 2020 Many sharing-economy platforms operate as follows. Owners list the availability of resources, prices, and contract-length limits. Customers propose contract start times and lengths. The owners decide immediately whether to accept or decline each proposal,
Shashank Goyal, Diwakar Gupta
doaj +1 more source
Model checking randomized distributed algorithms [PDF]
, 2020 International audienceRandomization is a powerful paradigm to solve hard problems, especially in distributed computing. Proving the correctness, and assessing the performances, of randomized distributed algorithms, is a very challenging research ...
Bertrand, Nathalie
core +1 more source
Novel and Efficient Randomized Algorithms for Feature Selection
Big Data Mining and Analytics, 2020 Feature selection is a crucial problem in efficient machine learning, and it also greatly contributes to the explainability of machine-driven decisions. Methods, like decision trees and Least Absolute Shrinkage and Selection Operator (LASSO), can select ...
Zigeng Wang +2 more
doaj +1 more source
A Quantum Algorithm for the Commutativity of Finite Dimensional Algebras
IEEE Access, 2019 A quantum procedure for testing the commutativity of a finite dimensional algebra is introduced. This algorithm, based on Grover's quantum search, is shown to provide a quadratic speed-up (when the number of queries to the algebra multiplication ...
Elias F. Combarro +2 more
doaj +1 more source
Formalizing Randomized Matching Algorithms [PDF]
Logical Methods in Computer Science, 2012 Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalize the correctness of two fundamental RNC^2 algorithms for bipartite perfect matching within the theory VPV for polytime reasoning.
Dai Tri Man Le, Stephen A. Cook
doaj +1 more source
Probabilistic Algorithmic Randomness
The Journal of Symbolic Logic, 2013 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
08201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms [PDF]
, 2008 From 11.05.08 to 16.05.08, the Dagstuhl Seminar 08201 ``Design and Analysis of Randomized and Approximation Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Dyer, Martin E. +2 more
core +1 more source