Results 251 to 260 of about 4,793 (299)
Sub-mV tunable photonic p-bits for probabilistic computing. [PDF]
Sci AdvSeo J +7 more
europepmc +1 more source
Physics-Informed Neural-Network-Based Generation of Composite Representative Volume Elements with Non-Uniform Distribution and High-Volume Fractions. [PDF]
Polymers (Basel)Zheng T, Cai C, Yang F, Wang R, Liu W.
europepmc +1 more source
Free will as structured unpredictability: toward a symbiotic human-AI relationship. [PDF]
Front Artif IntellGhomshei M, Abbaspour KC.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACM Computing Surveys, 1995
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in ...
Rajeev Motwani 0001, Prabhakar Raghavan
openaire +2 more sources
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in ...
Rajeev Motwani 0001, Prabhakar Raghavan
openaire +2 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
Rodney G. Downey +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
Rodney G. Downey +2 more
openaire +1 more source
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
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
Prediction algorithms and confidence measures based on algorithmic randomness theory [PDF]
Theoretical Computer Science, 2002 This paper reviews some theoretical and experimental developments in building computable approximations of Kolmogorov's algorithmic notion of randomness.
Volodya Vovk
exaly +2 more sources
On randomized Lanczos algorithms
Proceedings of the 1997 international symposium on Symbolic and algebraic computation - ISSAC '97, 1997Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algorithm that has been used for integer factorization, and to the (provably reliable) algorithm of Wiedemann.
Wayne Eberly, Erich L. Kaltofen
openaire +1 more source