| 淘汰赛编排算法理论研究 |
| |
| 引用本文： | 雷宾宾,董东风.淘汰赛编排算法理论研究[J].长沙通信职业技术学院学报,2011,10(1):96-100. |
| |
| 作者姓名： | 雷宾宾 董东风 |
| |
| 作者单位： | 长沙通信职业技术学院,湖南长沙,410015 |
| |
| 摘 要： | 以往淘汰赛编排方法存在两个方面的问题:一是"查表法"问题:二是'框图法"问题.经过研究,提出了两个算法:一个是"根种子"位置编排算法;另一个是"分组编码"算法.通过这两个算法解决了以往"查表法"和"框图法"所存在的问题.
|
| 关 键 词： | 淘汰赛 编排方法 算法 |
Research on knockout scheduling algorithm theory |
| |
| LEI Bin-bin,DONG Dong-feng.Research on knockout scheduling algorithm theory[J].Journal of Changsha Telecommunications and Technology Vocational,2011,10(1):96-100. |
| |
| Authors: | LEI Bin-bin DONG Dong-feng |
| |
| Affiliation: | LEI Bin-bin,DONG Dong-feng(Changsha Telecommunications and Technology Vocational College,Changsha,Hu'nan,China 410015) |
| |
| Abstract: | Previous knockout scheduling method has two problems: the first is table lookup method problem and the second is chart method problem.After the study,two algorithms are put forward: one is root seeds location layout algorithm,the other is packet coding algorithm.Through the two algorithms we solve the existing problems. |
| |
| Keywords: | knockout scheduling method algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
