Catalog Entries |
Date
Apr 26, 2024 |
|
 |
||
 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| CSC 614 - Meta-Heuristics |
|
This course covers widely used meta-heuristic optimization techniques in computing, such as simulated annealing, Tabu search, genetic algorithms, ant algorithms and de-randomized evolution strategies. Serial as well as parallel algorithms will be studied. Students will develop application projects from a wide range of application areas. The advantages and disadvantages of meta-heuristic search methods are discussed. [3-0, 3 cr.]
3.000 Credit hours 3.000 Lecture hours Levels: Graduate Schedule Types: Lecture, Tutorial Computer Science & Mathematics Department Course Attributes: MS-INE-Comp.Mod.Data.Anal.Req. |
|