- Schedule of Classes - January 14, 2015 6:16PM EST
- Course Catalog - January 14, 2015 6:21PM EST
Course information provided by the Courses of Study 2014-2015.
Teaches heuristic search methods including simulated annealing, tabu search, genetic algorithms, derandomized evolution strategy, and random walk developed for optimization of combinatorial- and continuous-variable problems. Application project options include wireless networks, protein folding, job shop scheduling, partial differential equations, satisfiability, or independent projects. Statistical methods are presented for comparing algorithm results. Advantages and disadvantages of heuristic search methods for both serial and parallel computation are discussed in comparison with other optimization algorithms.
When Offered Fall.
Prerequisites/Corequisites Prerequisites: CS 2110/ENGRD 2110; CEE 3200/ENGRD 3200, or graduate standing, or permission of instructor.
Disabled for this roster.