Results 111 to 120 of about 182,395 (164)
Some of the next articles are maybe not open access.
Theory of Probability & Its Applications, 1988
This paper is one of the last works of A. N. Kolmogorov who was the founder of many branches of probability theory. (Kolmogorov died on October 20, 1987.) He was one of the initiators of the algorithmic definition of randomness. His brilliant ideas influenced very deeply this area which had also profound implications for other fields of science from ...
Kolmogorov, A. N., Uspenskij, V. A.
openaire +3 more sources
This paper is one of the last works of A. N. Kolmogorov who was the founder of many branches of probability theory. (Kolmogorov died on October 20, 1987.) He was one of the initiators of the algorithmic definition of randomness. His brilliant ideas influenced very deeply this area which had also profound implications for other fields of science from ...
Kolmogorov, A. N., Uspenskij, V. A.
openaire +3 more sources
Computability, 2023
Rademacher (Mathematische Annalen 87 (1922) 112–138), Steinhaus (Mathematische Zeitschrift 31 (1930) 408–416) and Paley and Zygmund (Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 337–257, Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 458–474, Mathematical Proceedings of the Cambridge Philosophical
Downey, Rodney G. +2 more
openaire +1 more source
Rademacher (Mathematische Annalen 87 (1922) 112–138), Steinhaus (Mathematische Zeitschrift 31 (1930) 408–416) and Paley and Zygmund (Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 337–257, Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 458–474, Mathematical Proceedings of the Cambridge Philosophical
Downey, Rodney G. +2 more
openaire +1 more source
Communications of the ACM, 2019
Tracing some of the latest advancements in algorithmic randomness.
Rod Downey, Denis R. Hirschfeldt
openaire +1 more source
Tracing some of the latest advancements in algorithmic randomness.
Rod Downey, Denis R. Hirschfeldt
openaire +1 more source
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
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, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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