11: Parallele Algorithmen, Vorlesung, WS 2017/18, 15.01.2018
Update: 2018-01-18
Description
11 |
0:00:00 Starten
0:00:14 Finding lightest incident edges
0:01:19 Pseudotrees - Rooted Trees
0:03:00 Randomized Linear Time Algorithm
0:04:24 Parallel Filter Kruskal
0:05:40 Parallele Prioritätlisten
0:10:34 Naive Implementierung
0:11:30 Branch-and-Bound
0:25:18 Sequentielles Branch-and-Bound
0:35:27 Paralleles Branch-and-Bound
0:38:20 Analyse
0:52:09 Der Algorithmus von Karp und Zhang
1:01:47 Einfache Probabilistische Eigenschaften
1:04:01 Parallele Realisierung I
1:16:04 Parallele Realisierung II
0:00:00 Starten
0:00:14 Finding lightest incident edges
0:01:19 Pseudotrees - Rooted Trees
0:03:00 Randomized Linear Time Algorithm
0:04:24 Parallel Filter Kruskal
0:05:40 Parallele Prioritätlisten
0:10:34 Naive Implementierung
0:11:30 Branch-and-Bound
0:25:18 Sequentielles Branch-and-Bound
0:35:27 Paralleles Branch-and-Bound
0:38:20 Analyse
0:52:09 Der Algorithmus von Karp und Zhang
1:01:47 Einfache Probabilistische Eigenschaften
1:04:01 Parallele Realisierung I
1:16:04 Parallele Realisierung II
Comments
In Channel
Download from Google Play
Download from App Store
United States00:00
00:00
x
