5115 search results - page 334 / 1023 » On Randomized Lanczos Algorithms |
165
click to vote
WALCOM
2010
IEEE
16 years 2 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
208
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
160
click to vote
STACS
2005
Springer
16 years 23 days ago
2005
Springer
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
209
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
203
click to vote
FSTTCS
1995
Springer
15 years 11 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...