5153 search results - page 20 / 1031 » Introduction to Randomized Algorithms |
ICPP
2005
IEEE
15 years 3 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...
70
Voted
CSR
2007
Springer
15 years 3 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. ...
73
Voted
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
88
Voted
DAM
2006
14 years 9 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...