It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

We will discuss how to use these techniques for solving real-world problems in C++. Most assignments and examples will be based on competitive programming problems. The course assumes background in ...

Practical FPGA Programming In C. June 23, 2005. By David Pellerin and Scott Thibault. ... FPGAs are essentially used to implement software algorithms directly in hardware, ...

Atidel Ben Hadj-Alouane, James C. Bean, A Genetic Algorithm for the Multiple-Choice Integer Program, Operations Research, Vol. 45, No. 1 (Jan. - Feb., 1997), pp. 92-101 Link account to institutional ...