5138 search results - page 36 / 1028 » Randomized Algorithms for 3-SAT |
171
click to vote
ISSAC
2007
Springer
16 years 12 days 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...
172
click to vote
ICPP
2005
IEEE
15 years 12 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...
134
click to vote
CSR
2007
Springer
16 years 13 days 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. ...
150
click to vote
ISAAC
2005
Springer
15 years 11 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 ...
139
click to vote
GECCO
2006
Springer
15 years 10 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