Results 11 to 20 of about 125,297 (309)
On the Use of Biased-Randomized Algorithms for Solving Non-Smooth Optimization Problems [PDF]
Algorithms, 2019 Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ...
Angel Alejandro Juan +4 more
doaj +4 more sources
Randomized Parameterized Algorithms for the Kidney Exchange Problem
Algorithms, 2019 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 +3 more sources
Randomized priority algorithms
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelopoulos, Spyros, Borodin, Allan
openaire +5 more sources
Notes on Randomized Algorithms
CoRR, 2020 Lecture notes for the Yale Computer Science course CPSC 4690/5690 Randomized Algorithms. Suitable for use as a supplementary text for an introductory graduate or advanced undergraduate course on randomized algorithms. Discusses tools from probability theory, including random variables and expectations, union bound arguments, concentration bounds ...
Aspnes, James
openaire +3 more sources
An introduction to randomized algorithms
Discrete Applied Mathematics, 1991 The concept of randomization is known to be an extremely important tool for the design of algorithms. Its use often yields better time or space complexity compared with the best deterministic algorithms we know of for the same problem; moreover resulting randomized algorithms are often very simple to understand and implement.
Karp, Richard M., Richard M. Karp
openaire +2 more sources
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph [PDF]
, 2020 Article implements and tests the performances of several approximation algorithms for computing the minimum dominating set of a graph.
Potru, Rohan +5 more
core +1 more source
Randomized optimal stopping algorithms and their convergence analysis [PDF]
, 2020 In this paper we study randomized optimal stopping problems and consider corresponding forward and backward Monte Carlo based optimization algorithms.
Bayer, Christian +5 more
core +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