5115 search results - page 74 / 1023 » On Randomized Lanczos Algorithms |
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
STOC
1998
ACM
15 years 4 months ago
1998
ACM
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circu...
132
click to vote
SIAMCOMP
2010
14 years 6 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
113
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent year...