5153 search results - page 22 / 1031 » Introduction to Randomized Algorithms |
ISSAC
1997
Springer
15 years 1 months ago
1997
Springer
Las 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 algor...
108
click to vote
STOC
1989
ACM
15 years 1 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
69
Voted
DC
2000
14 years 9 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
CP
2006
Springer
15 years 1 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
TCS
2010
14 years 8 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...