Results 271 to 280 of about 125,297 (309)
A method for obtaining randomized algorithms with small tail probabilities
Algorithmica, 1996 We study strategies for converting randomized algorithms of the Las Vegas type into randomized algorithms with small tail ...
L Guibas, K Mehlhorn, A Wigderson
exaly +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
International Journal of Computational Geometry & Applications, 1992A set of n distinct points in the plane defines [Formula: see text] lines by joining each pair of distinct points. The median slope of these O(n2) lines was proposed by Theil as a robust estimator for the slope of the line of best fit for the points. We present a randomized algorithm for selecting the k-th smallest slope of such a set of lines which ...
Michael B. Dillencourt +2 more
openaire +2 more sources
Randomized algorithms and pseudorandom numbers
Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88, 1988Summary: 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
[1991] Proceedings. 11th International Conference on Distributed Computing Systems, 2002
A randomized algorithm for vote assignment is described. Given a collection of sites where copies of a file are replicated, and the individual site reliabilities, the algorithm assigns votes to sites so as to maximize overall availability. It is based on the concept of simulated annealing which has been successfully applied for various complex problems
openaire +1 more source
A randomized algorithm for vote assignment is described. Given a collection of sites where copies of a file are replicated, and the individual site reliabilities, the algorithm assigns votes to sites so as to maximize overall availability. It is based on the concept of simulated annealing which has been successfully applied for various complex problems
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
Randomized Algorithms for Lexicographic Inference
Operations Research, 2019Summary: 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 +2 more
openaire +2 more sources
Randomized algorithms on the mesh
1998The mesh-connected array is an attractive architecture for parallel machines, and a number of existing parallel machines are based on a mesh topology. In this paper, we survey the results on three fundamental problems in parallel computation: routing, sorting, and selection, and demonstrate that randomized algorithms for these problems on the mesh are ...
openaire +1 more source
The Reliability of Randomized Algorithms
The British Journal for the Philosophy of Science, 2000Recently, 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, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dimitris Bertsimas +2 more
openaire +1 more source
Randomized algorithms in robust control
42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475), 2004The 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