| 构建基层田径运动会日程编排的算法模型 |
| |
| 引用本文： | 李丹,王力晨. 构建基层田径运动会日程编排的算法模型[J]. 山西师大体育学院学报, 2002, 17(4): 55-57 |
| |
| 作者姓名： | 李丹 王力晨 |
| |
| 作者单位： | 1. 北京师范大学信息学院,北京,100875
2. 北京师范大学体育与运动学院,北京,100875 |
| |
| 摘 要： | 针对基层田径运动会较为复杂，随意性较强，日程编排既费时又费力还不能达到理想状况等特点，本在遵循田径运动会比赛规则的基础上结合基层运动会的实际情况，利用计算机这一信息社会的高级工具，提出并实现了一个短小精巧的算法模型，可以成功生成一个基于标准400米田径场地的较为合理的基层田径运动会的竞赛日程。
|
| 关 键 词： | 基层田径运动 日程编排 算法模型 最长比赛时间 最短休息时间 |
| 文章编号： | 1008-8571(2002)04-0055-03 |
| 修稿时间： | 2002-11-08 |
An Algorithm Model of Popular Track and Field Sports Meeting Schedule |
| |
| Affiliation: | ( The Information College,Beijing Teachers' Universtiy. Beijing 100875,China, PE and Sports College,Beijing Teachers' University,Beijing 100875,China) |
| |
| Abstract: | Popular track and field sports meetings are generally complicated and free in organization, with agenda arragement time - consuming and strenuous and yet usually hard to meet satisfaction. Aiming at these features, and with the aid of computer as a high -rank tool of the modern information society, we've come up with a short and delicate algorithm model, which is based on the combination of complying with the competing rules of the track and field sports, and the considering of actual conditions of this kind of popular sports meetings. This model can successfully create a rational emulating a-genda for a track and field sports meeting held on a standard 400m sports ground. |
| |
| Keywords: | popular track and field sports playing agenda max-playing-time niin-relaxing-time |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
