Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
Journal of Automated Reasoning
Hi-index | 0.00 |
GENET model has attracted much attention for its special feature in solving constraint satisfaction problems. However, the parameter setting problems have not been discussed in detail. In this paper, the convergent behavior of GENET is thoroughly analyzed and its learning strategy is generalized. The obtained results can shed light on choosing parameter values and exploiting problem specific information.