48 search results - page 1 / 10 » Local Search on Random 2 p-SAT |
ECAI
2000
Springer
15 years 1 months ago
2000
Springer
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...