5138 search results - page 8 / 1028 » Randomized Algorithms for 3-SAT |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
JSAT
2008
13 years 7 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
GECCO
2005
Springer
14 years 27 days ago
2005
Springer
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
AAAI
1997
13 years 8 months ago
1997
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...