Results 261 to 270 of about 4,793 (299)
Some of the next articles are maybe not open access.
IEEE Transactions on Information Theory, 2006
Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join and old nodes leave the network.
Stephen P. Boyd +3 more
openaire +1 more source
Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join and old nodes leave the network.
Stephen P. Boyd +3 more
openaire +1 more source
Algorithmic randomness and monotone complexity on product space [PDF]
Information and Computation, 2011 We study algorithmic randomness and monotone complexity on product of the set of infinite binary sequences. We explore the following problems: monotone complexity on product space, Lambalgen’s theorem for correlated probability, classification of random ...
Hayato Takahashi
exaly +2 more sources
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
Intelligent Evidence-Based Management for Data Collection and Decision-Making Using Algorithmic Randomness and Active Learning [PDF]
Intelligent Information Management, 2011 We describe here a comprehensive framework for intelligent information management (IIM) of data collec-tion and decision-making actions for reliable and robust event processing and recognition.
Harry Wechsler, Shen-Shyang Ho
exaly +1 more source
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