5115 search results - page 15 / 1023 » On Randomized Lanczos Algorithms |
129
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
113
click to vote
TCS
2010
15 years 1 months ago
2010
Abstract. It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-L¨of randomness. Joe Miller and And...
126
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
135
click to vote
ICPP
2005
IEEE
15 years 8 months ago
2005
IEEE
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...
CSR
2007
Springer
15 years 9 months ago
2007
Springer
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...