基于变化概率的网络选课系统算法研究  

Research on Algorithm of Web Course Selection-arrangement System Based on Varied Probability

作　　者：张戈[1] 

机构地区：[1]中国青年政治学院计算机教学与应用中心,北京100089

出　　处：《计算机与现代化》2009年第12期160-163,共4页Computer and Modernization

摘　　要：选课系统的关键是如何解决选课活动的公平性问题及大批量学生同时访问系统带来的网络拥堵问题,现有的选课算法在这些问题上都没有太好的表现。本文对现有选课算法进行了分析和研究,提出并详细阐述了一种新的选课算法——基于变化概率的公平选课算法。该算法使得每个学生在选课活动当中能拥有趋于均等的选课概率,从而使选课活动在最大程度上实现了公平性原则并极大地缓解了网络拥堵问题。The key of Web course selection-arrangement system is how to resolve the equity problem and network congestion problem caused by concurrent visit to system by multitudinous students. Existing algorithms have weak effect on these problems. This article analyzes and researches these existing algorithms, and proposes a new algorithm： algorithm of Web course selection-arrangement system based on probability. This algorithm makes every student have equal probability on the move of course selection, therefore, the equity problem and network congestion oroblem are resolved at large.

关 键 词：选课算法 变化概率 公平性 网络拥堵 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]