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...
Saved in:
主要作者: | |
---|---|
格式: | Thesis |
語言: | 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/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|