检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:谢晓敏 XIE Xiaomin(Department of Elementary Education, North Sichuan College of Preschool Teacher Education, Guangyuan 628017, China)
机构地区:[1]川北幼儿师范高等专科学校初等教育系,四川广元628017
出 处:《四川职业技术学院学报》2019年第1期160-168,共9页Journal of Sichuan Vocational and Technical College
摘 要:针对三种最优单循环赛程编排方法:参赛队数目n为奇数时的构造推理法、图论法和n为偶数时的改进贝格尔编排法,考虑到n较大时,利用程序编排会达到事半功倍的效果,笔者理清编程思路,用MTLAB编程给出赛程安排表、每个参赛队参加的场次数、每两场间隔场次数和总场次和。用特例n=20和n=21验证了n(n≥5)为奇数时每两场间隔场次数只有n-3/2,n-1/2,n(n≥5)为偶数时每两场间隔场次数只有n/2-2,n/2-1,n/2。The number of team is are odd that structures reasoning method and graph theory method meanwhile the number of team is even that improved Berger algorithm, which three methods are all optimal single cycle scheduling methods. Considering that n is getting bigger and bigger, programming will achieve twice the result with half the effort. The author arranged programming ideas and given single cycle schedule, numbers of attending match, number of intervals and the sum of intervals for every team. Special cases n = 20 and n = 21 are used to check that when the teams are even and greater than 5. There are only two intervals (n-3)/2,(n-1)/2 for every team and when the teams are odd and greater than 5 and there are only three intervals n/2-2,n/2-1,n/2.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.167.132