Results 211 to 220 of about 3,571 (240)
Some of the next articles are maybe not open access.
Randomized parallel algorithms
1996In 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 +2 more
openaire +1 more source
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 +2 more
openaire +1 more source
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 +2 more
openaire +1 more source
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
P. Martin-Löf, P. Martin-Lof
openaire +2 more sources
Randomized Priority Algorithms
2004In 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
2009A 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