ECE 4271
Last Updated
- Schedule of Classes - June 18, 2018 7:14PM EDT
- Course Catalog - June 14, 2018 7:15PM EDT
Classes
ECE 4271
Course Description
Course information provided by the Courses of Study 2017-2018.
Course addresses a collection of topics relevant to the modeling, analysis, simulation, and optimization of large complex multi-agent systems. Course provides a standalone introduction to discrete-time Markov chains; covers the Metropolis algorithm and its generalizations; gives an introduction to the theory of genetic algorithms; and provides an introduction to evolutionary game theory, including the ESS concept, replicator dynamics, and dynamic probabilistic approaches.
When Offered Spring.
Prerequisites/Corequisites Prerequisite: MATH 2930, MATH 2940, and ECE 3100 or permission of instructor.
Outcomes
- Develop an understanding of discrete-time Markov chains with countable state spaces.
- Learn about the historical development of various random-search techniques.
- Attain a fairly deep understanding of the theory of genetic algorithms.
- Attain a basic understanding of evolutionary game theory and its importance in modeling and analysis of modern large-scale systems.
Regular Academic Session.
-
Credits and Grading Basis
3 Credits Graded(Letter grades only)
-
Class Number & Section Details
-
Meeting Pattern
- TR Phillips Hall 219
Instructors
Delchamps, D
Share
Disabled for this roster.