CS 5722

CS 5722

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.

View Enrollment Information

Enrollment Information
Syllabi: none
  •   Regular Academic Session.  Combined with: CEE 5290ORIE 5340

  • 3-4 Credits Stdnt Opt

  • 12087CS 5722  LEC 001

  • Instruction Mode: