| 九宫排定问题的新算法 |
| |
| 引用本文： | 姜学东.九宫排定问题的新算法[J].四川大学学报(自然科学版),1990,27(1):29-36. |
| |
| 作者姓名： | 姜学东 |
| |
| 作者单位： | 四川大学计算机科学系 |
| |
| 摘 要： | 在已有工作基础上重新构造了九宫排定问题的算法.在该算法中采用了预处理,在循环中控制已排定数字的位置变化,使得以往算法中的环向移动不复存在,从而优化了算法,降低了计算复杂性.
|
| 关 键 词： | 九宫排定 预处理 循环 计算复杂性 |
A NEW ALGORITHM FOR THE SCHEDULING PROBLEM IN 9-LATTICE |
| |
| Jiang Xuedong.A NEW ALGORITHM FOR THE SCHEDULING PROBLEM IN 9-LATTICE[J].Journal of Sichuan University (Natural Science Edition),1990,27(1):29-36. |
| |
| Authors: | Jiang Xuedong |
| |
| Institution: | Dept. of Computer Science |
| |
| Abstract: | In this paper a new algorithm for the scheduling problem in 9-lattice is presented. The newly constructed algorithm, due to the adoption of a pre-processing procedure and a control mechanism in loops lo limit the position changes of the numbers that are already scheduled, is more efficient than already published ones. For any sovable initial configuration, to acheive the objective configuration, at most 86 moves, or not more than 38 moves, is needed by using this new algorithm. |
| |
| Keywords: | scheduling problem configuration loop |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
