SOLVING FILE ALLOCATION PROBLEM BASED ON GENETIC ALGORITHMS
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    FAP(file allocation problem) is a very important problem in computer network and distributed system. This paper presented a new method to solve FAP based on genetic algorithms. The method can well solve optimal file allocation problem in engineering. The method can be also applied in other situations besides the FAP, in those situations resources need to be allocated.

    Reference
    Related
    Cited by
Get Citation

孟祥武,程虎.利用遗传算法求解文件分配问题.软件学报,1997,8(2):122-127

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:January 15,1996
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063