GSAT搜索的实证分析
An Empirical Analysis of Search in GSAT
摘要：
我们描述了一个广泛的研究搜索GSAT，命题可满足性的近似过程。GSAT对真值分配中满足子句的数量执行贪婪爬山。我们的实验提供了一个更完整的图片GSAT的搜索比以前的帐户。我们详细描述了两个阶段的搜索：快速爬山，然后是一个长期的高原搜索。我们证明，当应用于随机生成的3SAT问题，有一个非常简单的缩放与问题的大小为满意的条款和平均分支率的平均数。我们的研究结果使我们能够详细的数值计算爬山阶段的长度，这一阶段的平均梯度，并推测，在高原搜索的平均得分和平均分支率呈指数衰减。最后，我们展示了这些结果可以用来指导未来的理论分析。这项工作提供了一个案例研究如何计算机实验可以用来提高算法的理论特性的理解。
英文摘要：
We describe an extensive study of search in GSAT, an approximation procedure for propositional satisfiability. GSAT performs greedy hill-climbing on the number of satisfied clauses in a truth assignment. Our experiments provide a more complete picture of GSAT's search than previous accounts. We describe in detail the two phases of search: rapid hill-climbing followed by a long plateau search. We demonstrate that when applied to randomly generated 3SAT problems, there is a very simple scaling with problem size for both the mean number of satisfied clauses and the mean branching rate. Our results allow us to make detailed numerical conjectures about the length of the hill-climbing phase, the average gradient of this phase, and to conjecture that both the average score and average branching rate decay exponentially during plateau search. We end by showing how these results can be used to direct future theoretical analysis. This work provides a case study of how computer experiments can be used to improve understanding of the theoretical properties of algorithms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
