Application of Ant Colony Algorithm in Distributed and Shared Educational Resources System
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    The schedule between servers and users is a MOP (Multi-objective Optimization Problems), in a distributed and shared educational resources system. Ant colony algorithm has been proved to be a kind of effective algorithm to solve it. A common model of the above schedule was given, and ant colony algorithm was applied to optimize the schedule. The experiment results show that the effect of this optimization is evident.

    Reference
    Related
    Cited by
Get Citation

李昕,荆永君.蚁群算法在教育资源分布式共享系统中的应用.计算机系统应用,2012,21(10):40-42,75

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 19,2012
  • Revised:March 23,2012
  • 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