Results 131 to 140 of about 348,583 (163)

Algorithmic randomness

Communications of the ACM, 2019
Tracing some of the latest advancements in algorithmic randomness.
Rod Downey, Denis R. Hirschfeldt
openaire   +1 more source

Randomized Algorithms

2011
AbstractCertain situations require a random rather than a deterministic strategy. With a random strategy, the choices are unpredictable and the adversary may be kept off balance. This chapter focuses on the variety and power of randomised algorithms. More specifically, it considers algorithms that find the smallest cut in a graph by combining random ...
Cristopher Moore, Stephan Mertens
openaire   +1 more source

Randomized geometric algorithms and pseudorandom generators

Algorithmica, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Randomized parallel algorithms

1996
In this paper we show some important randomized techniques for the parallel processing of discrete problems. In particular, we present a few parallel randomized algorithms frequently used for shortest paths problems, matching problems, depth first search and maximum independent set problems.
Andrea Clementi, José D. P. Rolim, Erik Urland   +2 more
openaire   +1 more source

Planned Random Algorithm

2018
Computers are very systemized and none of the procedures conducted by them are random. But computers are seldom required to generate a random number for many practical applications like gaming, accounting, encryption/decryption and many more. The number generated by the computer relies on the time or the CPU clock. A given computer can be programmed to
Anurag Pant, Kunwar Agrawal, B. K. Tripathy   +2 more
openaire   +1 more source

Algorithms and Randomness

Revue de l'Institut International de Statistique / Review of the International Statistical Institute, 1969
P. Martin-Löf, P. Martin-Lof
openaire   +2 more sources

Randomized Priority Algorithms

2004
In a paper of Borodin, Nielsen and Rackoff [8], a framework for abstracting the properties of deterministic greedy-like algorithms was proposed. We extend their model so as to formally define ”randomized greedy-like algorithms” and be able to prove lower bounds on the approximability of a certain problem by such a class of algorithms.
openaire   +1 more source

Randomized Exponentiation Algorithms

2009
A randomized algorithm for function f takes the usual inputs for f together with a stream of random numbers and combines them in a way such that partial or complete knowledge of the atomic operations used to compute f does not easily reveal the values of some or all inputs.
openaire   +1 more source

Randomized Algorithms

2023
openaire   +1 more source

Randomized Algorithms

2001
openaire   +2 more sources