20. Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees

Описание к видео 20. Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees

MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Complete course playlist:    • 1. Course Overview, Interval Scheduling  
Instructor: Nancy Ann Lynch

In this lecture, Professor Lynch introduces asynchronous distributed algorithms.

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Комментарии

Информация по комментариям в разработке