Select the desired Level or Schedule Type to find available classes for the course. |
CSCI 2950S - Advanced Practical Combinatorial Algorithms |
We review recent as well as well-established advanced techniques in combinatorial optimization and constraint satisfaction. Students will study and individually present research papers and work on challenging software projects in small teams. Prerequisites: CSCI 0160, 0180, or 0190; and CSCI 0510; and CSCI 1490 or 2580, or instructor permission.
0.000 OR 1.000 Credit hours 0.000 OR 1.000 Lecture hours Levels: Graduate, Undergraduate Schedule Types: Discussion Section/Conference, Primary Meeting Computer Science Department Prerequisites: (Undergraduate level CSCI 0160 Minimum Grade of S or Undergraduate level CSCI 0180 Minimum Grade of S or Undergraduate level CSCI 0190 Minimum Grade of S) and (Undergraduate level CSCI 0510 Minimum Grade of S) and (Undergraduate level CSCI 1490 Minimum Grade of S or Graduate level CSCI 2580 Minimum Grade of S) |
Return to Previous | New Search |