Results 251 to 260 of about 10,207,361 (300)
Some of the next articles are maybe not open access.
Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks
Ad hoc networks, 2013Vehicular Ad-Hoc Networks (VANETs) enable inter vehicle wireless communication as well as communication with road side equipment. Warning messages can be exchanged among nearby vehicles, helping to predict dangerous situations, and thus improving road ...
Efi Dror, C. Avin, Zvi Lotker
semanticscholar +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
[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
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 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
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
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
Fast randomized algorithm for hierarchical clustering in Vehicular Ad-Hoc Networks
IFIP Annual Mediterranean Ad Hoc Networking Workshop, 2011Vehicular Ad-Hoc Networks (VANETs) offer communication between vehicles and infrastructure. Warning messages, among others, can be used to alert drivers, and thus improve road safety. To adapt to the unique nature of VANETs, which demands the delivery of
Efi Dror, C. Avin, Zvi Lotker
semanticscholar +1 more source
An Efficient Randomized Algorithm for Computing the Approximate Tucker Decomposition
Journal of Scientific Computing, 2021Maolin Che, Yimin Wei, Hong Yan
semanticscholar +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