resourceType:"ocw" continent:"North America" country:"United States" Areas:"Electrical Engineering and Computer Science"
Categories
Geo
3 results found in 9 ms.

Page 1 of 1

More OCW like this | |
Published by: Massachusetts Institute of Technology | Language: English
Share in: Share this resource in Facebook Share this resource in Twitter Share this resource in LinkedInd Share this resource in Google+ Share this resource in Pinterest Share this resource in Blogger Share this resource in Tumblr

This course will focus on fundamental subjects in (deterministic) optimization, connected through the themes of convexity, geometric multipliers, and duality. The aim is to develop the core analytical and computational issues of continuous optimization, duality, and saddle point theory using a handful of unifying principles that can be easi
Author(s):
Tag(s):
More OCW like this | |
Published by: Massachusetts Institute of Technology | Language: English
Share in: Share this resource in Facebook Share this resource in Twitter Share this resource in LinkedInd Share this resource in Google+ Share this resource in Pinterest Share this resource in Blogger Share this resource in Tumblr

Data structures play a central role in modern computer science. You interact with data structures much more often than with algorithms (think of Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course will cover major results and curr
Author(s):
Tag(s):


More OCW like this | |
Published by: Massachusetts Institute of Technology | Language: English
Share in: Share this resource in Facebook Share this resource in Twitter Share this resource in LinkedInd Share this resource in Google+ Share this resource in Pinterest Share this resource in Blogger Share this resource in Tumblr

This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimu
Author(s):
Tag(s):


3 results found.

Page 1 of 1