Algorithms of Web Course Selection-Arrangement System Based on Varied Probability
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The most important and difficult thing is how to find an algorithm which can resolve the equity problem and network congestion problem caused by concurrent visit to system by multitudinous students. This paper analyzes and researches these existing algorithm, and proposes new algorithms-Algorithms of Web Course Selection-Arrangement System based on probability. These algorithms make every student have equal probability on the move of course selection. Therefore, the equity and network congestion can be resolved at large.

    Reference
    Related
    Cited by
Get Citation

张戈.基于变化概率的网络选课系统公平算法.计算机系统应用,2010,19(4):181-184

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 02,2009
  • Revised:September 21,2009
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063