| 带权PLA折叠问题及其启发式算法 |
| |
| 引用本文： | 孙孝瑞.带权PLA折叠问题及其启发式算法[J].青岛大学学报(自然科学版),1995,8(1):73-78. |
| |
| 作者姓名： | 孙孝瑞 |
| |
| 作者单位： | 青岛大学计算机系 |
| |
| 摘 要： | 本文将可编程逻辑阵列（ＰＬＡ）的折叠问题推广到行列折叠点间带权的一般情况，对这个ＮＰ－完全问题给出三个启发式算法，其中两个为贪心类算法，另一个是利用独立集的启发式算法，分析了各个算法的复杂性。
|
| 关 键 词： | 启发式算法 贪心算法 可编程逻辑阵列 折叠问题 |
THE WEIGHTED PLA FOLDING PROBLEM AND ITS HEURISTIC ALGORITHMS |
| |
| Sun Xiaorui.THE WEIGHTED PLA FOLDING PROBLEM AND ITS HEURISTIC ALGORITHMS[J].Journal of Qingdao University(Natural Science Edition),1995,8(1):73-78. |
| |
| Authors: | Sun Xiaorui |
| |
| Abstract: | his paper generalizes the PLA folding problem in mathematical model:the weighted PLA folding problem. This is a NP-complete problem. Three heuristic algorithms for this problem are put formard,one is greedy algorithm,second is revised greedy algorithm,the third is based on independent set,and their complexities are given. |
| |
| Keywords: | PLA heuritic algorithm algorithm complexity independnt set greedy algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
