Enhancement of Ant System Algorithm for Course Timetabling Problem
As a member of the NP Problem, an exact algorithm to solve the course scheduling problem is not available to date. It is believe that this kind of problem can not be solved by any deterministic algorithm except with the one that performs checking for all possible solution exhaustedly to find solutio...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | 学位論文 |
| 言語: | English English |
| 出版事項: |
2009
|
| 主題: | |
| オンライン･アクセス: | http://etd.uum.edu.my/1525/1/Djasli_Djamarus.pdf http://etd.uum.edu.my/1525/2/1.Djasli_Djamarus.pdf http://etd.uum.edu.my/1525/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|