This course 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) ...

Dynamic programming (DP) algorithms have become indispensable in computational biology, addressing problems that range from sequence alignment and phylogenetic inference to RNA secondary structure ...

This course covers reinforcement learning aka dynamic programming, which is a modeling principle capturing dynamic environments and stochastic nature of events. The main goal is to learn dynamic ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

Bio-inspired computational methods have gained popularity recently. These methods mimic the seemingly complex behavior of ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

The Optimisation and Algorithms (OA) Group conducts research and teaching in the theory and applications of Operations Research (OR). The group's foremost interest is in fundamental research in OR and ...