| 基于隐含条件挖掘的枚举算法优化 |
| |
| 引用本文： | 李六杏.基于隐含条件挖掘的枚举算法优化[J].安徽技术师范学院学报,2013(6):66-69. |
| |
| 作者姓名： | 李六杏 |
| |
| 作者单位： | 安徽经济管理学院,安徽合肥230031 |
| |
| 摘 要： | 枚举算法就是按问题本身的性质,一一列举出该问题所有可能的解,检验每个可能解是否是问题的真正解.在利用枚举法解题时,需要枚举出问题的解的所有状态,其致命的弱点便在于枚举量太大,从而导致算法效率十分低下.本文旨在通过对问题的分析,挖掘出问题的隐含条件,对枚举算法进行优化,提高枚举效率.
|
| 关 键 词： | 枚举算法 隐含条件 优化 挖掘 |
The Implicit Enumeration Algorithm Based on Mining Conditions |
| |
| Institution: | LI Liu - xing (Anhui Institute of Economic Management, Hefei 230031, China) |
| |
| Abstract: | Enumeration algorithm is computed according to the nature of the problem itself. One listed all of the possible solutions to the problem. And every possible solution is the real solution to the problem. In the problem solving using enumeration method, the fatal weakness is that the enumeration is too big. So the algorithm efficiency is very low. This paper aims to analyze the problem, dig out the problem of implied conditions, and the e- numeration algorithm, so as to improve the efficiency of enumeration. |
| |
| Keywords: | Enumeration algorithm Implied condition Optimize Dig |
| 本文献已被 维普 等数据库收录！ |
|
