1369 search results - page 69 / 274 » Lattice computations for random numbers |
159
click to vote
AISC
2008
Springer
15 years 7 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
173
click to vote
JCO
1998
15 years 5 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
130
click to vote
JACM
2011
15 years 15 days ago
2011
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
135
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
145
Voted
PODC
2010
ACM
15 years 9 months ago
2010
ACM
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...