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 ...

Combinatorial optimisation problems arise in many fields, from logistics and network design to machine learning and bioinformatics. Most classical formulations are NP-hard, rendering exact ...

The Traveling Salesman Problem (TSP) is a prototypical NP-hard combinatorial optimisation challenge: given a set of locations and pairwise distances satisfying the triangle inequality, find the ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

In applications like routing, job scheduling, caching, etc., requests arrive sequentially, and the goal of the system is to handle requests as they arrive, while optimizing an appropriate overall ...

Continuing their reverse-engineering of Intel’s 8087 FPU, [Ken Shirriff] and friends took a look at one of the trigonometric ...

The standard practice for calculating the ripple voltage of a simple rectifier circuit with a reservoir capacitor (Fig. 1) is to linearize the problem. A linear approximation of the voltage across the ...