| 可满足性问题的填充函数算法 |
| |
| 引用本文： | 林耿.可满足性问题的填充函数算法[J].闽江学院学报,2011,32(2):12-15. |
| |
| 作者姓名： | 林耿 |
| |
| 作者单位： | 闽江学院数学系,福建福州,350108 |
| |
| 摘 要： | 可满足性问题是第一个被证明为NP-complete问题.首先给出两个解之间距离的概念,其次构造出一类单参数填充函数,该函数形式简洁,便于计算.然后,针对可满足性问题提出了一类填充函数算法,实验表明该算法是有效的.
|
| 关 键 词： | 可满足性问题 填充函数 启发式 |
A filled function method for satisfiability problem |
| |
| LIN Geng.A filled function method for satisfiability problem[J].Journal of Minjiang University,2011,32(2):12-15. |
| |
| Authors: | LIN Geng |
| |
| Institution: | LIN Geng (Department of Mathematics,Minjiang University,Fuzhou,Fujian 350108,China) |
| |
| Abstract: | Satisfiability problem is firstly proved to be an NP-complete problem.Firstly,this paper defines a concept of the distance between two solutions.Next,a filled function with only one parameter is constructed,it is simple and easy to calculate.Then a filled function method for satisfiability problem is proposed,numerical results show that the proposed algorithm is efficient. |
| |
| Keywords: | satisfiability problem filled function heuristic |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
