5138 search results - page 103 / 1028 » Randomized Algorithms for 3-SAT |
107
click to vote
SAT
2005
Springer
15 years 7 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
106
click to vote
WDAG
2010
Springer
15 years 6 days ago
2010
Springer
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
107
Voted
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
111
Voted
SIAMDM
2002
15 years 1 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
122
click to vote
CCA
2009
Springer
15 years 8 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...