About

Brief Description

Making sub-optimal or random choices, an apparently silly idea, can have unexpectedly drastic improvement in the efficiency, complexity and other desirable properties of algorithms for diverse problems. In this course, we embark on an amazing journey to explore the power of using approximate, incomplete, or probabilistic knowledge in algorithmic design, and the elegant theories that explain such power.

Pre-requisites 

CIS507 Algorithms

Lecturer

Sid C-K Chau (ckchau(at)masdar.ac.ae)

Teaching Assistants

TBD

Assessment

Class Seminars 40%
Class Participation 20%
Project 40%