|
|||
CMSI 282 Algorithms3 semester hours Algorithm paradigms, with an emphasis on combinatoral search. Topics include: generating combinatorial objects; greedy methods, dynamic programming; randomized algorithms; modern heuristics such as genetic programs and simulated annealing; advanced sorts and order statistics; cake-cutting and fair division; graph algorithms; computational geometry. Lecture, 3 hours. Prerequisite: CMSI 281 . |
|||
All bulletins © 2024 Loyola Marymount University. Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).
|