Hanbook of Bioinspired Algorithms and Applications, Stephan Olariu and Albert Zomaya,
Chapman and Hall, 2006.
Imitation of Life - How Biology Is Inspiring Computing, Nancy Forbes, MIT Press,
2004.
Papers Indicated by Instructor.
There will be frequent reading assignments, presentations, discussions as well as some writing assignments. All of them will account for 60% of the grade. The final exam will consist of a research project and/or a research paper which will account for 40% of the grade.
You may find the course outline in my home page at: http://www.cse.msstate.edu/~ioana/Courses/CSE9133.html . Important announcements will also be posted there. Students are responsible for checking the announcements regularly.
The course will cover material from the following topics:
Biologically inspired computing (evolutionary algorithms, cellular automata, DNA computation, amorphous computing, etc).
Algorithms and optimization (graph algorithms, combinatorial scientific computing, Monte-Carlo simulations, linear, nonlinear and discrete optimization, and others).
Autonomic attributes and the grand challenge.
Complexity in autonomic computing and its forms.
Machine learning and multiagent systems in the development of autonomic computing.
Architecture, open standards, implementation considerations, enabling technology and development tools.
State-of-the-art of present technology in autonomic computing.
Ongoing widely known projects - strengths and limitations.
Students who are auditing this course must attend at least 75% of the class lectures to avoid a grade of F.
[INSTRUCTOR] [HOURS] [PREREQUISITES] [OBJECTIVES] [REQUIREMENTS] [GRADING] [ANNOUNCEMENTS] [OUTLINE]