期刊文献+

志愿选课算法分析与优化研究 被引量:3

Volunteers course algorithm analysis and optimization research
下载PDF
导出
摘要 本文针对志愿选课算法的不足,分析了该算法中存在因志愿选择不当而易造成所选课程脱选等问题,进一步对该算法进行优化,提出了基于权重的志愿选课算法。该算法分两步实现:首先,学生根据所列举的课程填写选课志愿,并统计每门课程各个志愿的填报人数;然后参考学生自身权重值进行抽签,进而生成最终选课结果表。该算法在选课中不仅结合了学生对课程的偏好和需求,同时参考了学生自身的权重值,从而保证了选课结果更加合理、科学。 In this paper, it accounts for the lack of voluntary selection course algorithm and analyses issues because of the improper voluntary selection course. In order to optimize the selection algorithm, it proposes voluntary selection course based on the weight algorithm. In two steps implementing the algorithm: one is which students fill course volunteers according to the listed courses and which the number of students is count by every volunteers; the other is which the final course selection list of results is generated according to students own weights. The algorithm in selecting course not only combines students' preferences and needs, but also refers to students own weights, thus ensuring the selective results more reasonable and scientific.
作者 杨东风
出处 《电子设计工程》 2011年第5期108-110,共3页 Electronic Design Engineering
关键词 抽签算法 志愿算法 权值 优化研究 draw algorithm volunteer algorithm weights optimization research
  • 相关文献

参考文献7

二级参考文献21

共引文献44

同被引文献19

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部