Study proposes a communication-efficient, divide and conquer algorithm that combines information from sub-machines using confidence distributions. The theoretical relationship between the number ...

About this Course This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms.

A lot of students begin by finding a common denominator for the dividend and divisor when dividing by a fraction. And a lot of teachers intervene by saying, "Remember, you only need a common ...

Karatsuba’s divide-and-conquer multiplication algorithm takes advantage of this saving. Consider a multiplication algorithm that parallels the way multiplication of complex numbers works.

A new algorithm which could provide a solution to the age old Traveling Salesman Problem (TSP) has been improved by a student.

Designed as a nearly-impossible-to-conquer follow-up to the regular Pac-Man, the game turned out to be a perfect target for testing complex machine learning algorithms.