Results 181 to 190 of about 243 (214)

Randomized algorithms and pseudorandom numbers

Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88, 1988
Summary: Randomized algorithms are analyzed as if unlimited amounts of perfect randomness were available, while pseudorandom number generation is usually studied from the perspective of cryptographic security or for the statistical properties of the numbers generated. \textit{E. Bach} [J. Comput. Syst. Sci. 42, No.
Howard J. Karloff, Prabhakar Raghavan
openaire   +1 more source

Randomized Algorithms for Lexicographic Inference

Operations Research, 2019
Summary: The inference of a lexicographic rule from paired comparisons, ranking, or choice data is a discrete optimization problem that generalizes the linear ordering problem. We develop an approach to its solution using randomized algorithms. First, we show that maximizing the expected value of a randomized solution is equivalent to solving the ...
Rajeev Kohli, Khaled Boughanmi, Vikram Kohli   +2 more
openaire   +2 more sources

The Reliability of Randomized Algorithms

The British Journal for the Philosophy of Science, 2000
Recently, certain philosophers of mathematics (Fallis [1997]; Womack and Farach [1997]) have argued that there are no epistemic considerations that should stop mathematicians from using probabilistic methods to establish that mathematical propositions are true. However, mathematicians clearly should not use methods that are unreliable.
openaire   +1 more source

On dependent randomized rounding algorithms

Operations Research Letters, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra   +2 more
openaire   +1 more source

Randomized algorithms in robust control

42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475), 2004
The probabilistic approach to analysis and design of robust control systems is an emerging philosophy that gained increasing interest in the past. Opposed to the so-far dominating paradigm of deterministic worst-case robustness, the probabilistic approach presents itself as a natural tool to deal with the random character of uncertainties affecting ...
G Calafiore, F Dabbene, R Tempo
openaire   +3 more sources

On Assessing the Performance of Randomized Algorithms

Journal of Algorithms, 2000
Summary: We study randomized algorithms with random input. We adapt to such algorithms the notion of probability of a false positive which is common in epidemiological studies. The probability of a false positive takes into account both the (controlled) error of the randomization and the randomness of the input, which needs to be modeled. We illustrate
openaire   +2 more sources

Introduction to randomized algorithms

1998
This chapter presents a short introduction to randomized algorithms, demonstrating their usefulness by showing that an essentially trivial randomized algorithm for MAXE3SAT (the version of MAX3SAT in which all clauses have exactly three literals) has expected performance ratio 8/7.
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

Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators

Physics Letters, Section A: General, Atomic and Solid State Physics, 2021
Maximilian Schlosshauer
exaly  

On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness

International Journal of Approximate Reasoning, 2022
Gert De Cooman, Floris Persiau
exaly