| 摘要: |
| 提出了在二元约束满足问题中以搜索结点个数为衡量标准的求解开销模型,该模型被应用于随机二元约束满足问题的求解开销相变分析中,并且比较了模型所导出的理论开销和实际中的搜索结点个数、约束检查次数、求解时间3种衡量标准的开销之间的相似性.在模型的基础上，探讨了求解启发式减少求解开销的作用，给出了一个新的变量选择启发式. |
| 关键词: 约束满足，求解开销，相变，求解启发式. |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家自然科学基金和国家教委博士点基金资助. |
|
| A Node Cost Model in Solving Binary Constraint Satisfaction Problems |
|
XUE Han-hong,CAI Qing-sheng
|
| Abstract: |
| A model of evaluating cost by number of nodes searched in solving binary constraint satisfaction problems is introduced in this paper. It has been applied to the random binary constraint satisfaction problems to analyze the phase transition property of solving cost. The theoretical cost induced from the model is compared with those practical costs evaluated by number of nodes searched, number of constraints checked and time consumed respectively. Based on this model, the effect of using solving heuristics to reduce cost is discussed and a new variable ordering heuristic is given. |
| Key words: Constraint satisfaction, solving cost, phase transition, solving heuristics. |
