Algorithms.Design.and.Analysis-Part.2-Stanford-Coursera

BT种子名称

分享给好友

BT种子基本信息

种子哈希：369a8c779df0876ef78e019be0d3e586a10b135f
文档大小：1.7 GB
文档个数：104个文档
下载次数：167次
下载速度：极快
收录时间：2017-09-25
最近下载：2025-01-23
DMCA/屏蔽：DMCA/屏蔽

下载磁力链接

magnet:?xt=urn:btih:369A8C779DF0876EF78E019BE0D3E586A10B135F
复制磁力链接到utorrent、Bitcomet、迅雷、115、百度网盘等下载工具进行下载。

下载BT种子

磁力链接种子下载迅雷下载二维码迅雷看看
磁力链接在线播放？试试百度云网盘离线下载播放！

Algorithms.Design.and.Analysis-Part.2-Stanford-Coursera的二维码

文档列表

1 Two Motivating Applications/1 - 1 - Application- Internet Routing (11 min).mp4 14.5 MB
1 Two Motivating Applications/1 - 2 - Application- Sequence Alignment (9 min).mp4 11.6 MB
10 Introduction to Dynamic Programming/10 - 1 - Introduction- Weighted Independent Sets in Path Graphs (8 min).mp4 11.8 MB
10 Introduction to Dynamic Programming/10 - 2 - WIS in Path Graphs- Optimal Substructure (9 min).mp4 14.2 MB
10 Introduction to Dynamic Programming/10 - 3 - WIS in Path Graphs- A Linear-Time Algorithm (10 min).mp4 15.2 MB
10 Introduction to Dynamic Programming/10 - 4 - WIS in Path Graphs- A Reconstruction Algorithm (7 min).mp4 10.1 MB
10 Introduction to Dynamic Programming/10 - 5 - Principles of Dynamic Programming (8 min).mp4 12.9 MB
11 The Knapsack Problem/11 - 1 - The Knapsack Problem (10 min).mp4 14.8 MB
11 The Knapsack Problem/11 - 2 - A Dynamic Programming Algorithm (10 min).mp4 14.3 MB
11 The Knapsack Problem/11 - 3 - Example [Review - Optional] (14 min).mp4 25.4 MB
12 Sequence Alignment/12 - 1 - Optimal Substructure (14 min).mp4 20.5 MB
12 Sequence Alignment/12 - 2 - A Dynamic Programming Algorithm (12 min).mp4 17.5 MB
13 Optimal Binary Search Trees/13 - 1 - Problem Definition (12 min).mp4 18.0 MB
13 Optimal Binary Search Trees/13 - 2 - Optimal Substructure (9 min).mp4 14.6 MB
13 Optimal Binary Search Trees/13 - 3 - Proof of Optimal Substructure (7 min).mp4 10.3 MB
13 Optimal Binary Search Trees/13 - 4 - A Dynamic Programming Algorithm I (10 min).mp4 14.7 MB
13 Optimal Binary Search Trees/13 - 5 - A Dynamic Programming Algorithm II (9 min).mp4 12.5 MB
14 The Bellman-Ford Algorithm/14 - 1 - Single-Source Shortest Paths, Revisted (11 min).mp4 15.9 MB
14 The Bellman-Ford Algorithm/14 - 2 - Optimal Substructure (11 min).mp4 16.0 MB
14 The Bellman-Ford Algorithm/14 - 3 - The Basic Algorithm I (9 min).mp4 12.7 MB
14 The Bellman-Ford Algorithm/14 - 4 - The Basic Algorithm II (11 min).mp4 14.3 MB
14 The Bellman-Ford Algorithm/14 - 5 - Detecting Negative Cycles (9 min).mp4 13.4 MB
14 The Bellman-Ford Algorithm/14 - 6 - A Space Optimization (12 min).mp4 19.2 MB
14 The Bellman-Ford Algorithm/14 - 7 - Internet Routing I [Optional] (11 min).mp4 17.5 MB
14 The Bellman-Ford Algorithm/14 - 8 - Internet Routing II [Optional] (7 min).mp4 11.2 MB
15 All-Pairs Shortest Paths/15 - 1 - Problem Definition (7 min).mp4 9.9 MB
15 All-Pairs Shortest Paths/15 - 2 - Optimal Substructure (12 min).mp4 17.3 MB
15 All-Pairs Shortest Paths/15 - 3 - The Floyd-Warshall Algorithm (13 min).mp4 19.8 MB
15 All-Pairs Shortest Paths/15 - 4 - A Reweighting Technique (14 min).mp4 20.6 MB
15 All-Pairs Shortest Paths/15 - 5 - Johnson-'s Algorithm I (11 min).mp4 16.2 MB
15 All-Pairs Shortest Paths/15 - 6 - Johnson-'s Algorithm II (11 min).mp4 17.7 MB
16 NP-Complete Problems/16 - 1 - Polynomial-Time Solvable Problems (14 min).mp4 21.5 MB
16 NP-Complete Problems/16 - 2 - Reductions and Completeness (14 min).mp4 20.8 MB
16 NP-Complete Problems/16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).mp4 17.1 MB
16 NP-Complete Problems/16 - 4 - Definition and Interpretation of NP-Completeness II (8 min).mp4 12.8 MB
16 NP-Complete Problems/16 - 5 - The P vs. NP Question (9 min).mp4 15.0 MB
16 NP-Complete Problems/16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).mp4 20.8 MB
17 Faster Exact Algorithms for NP-Complete Problems/17 - 1 - The Vertex Cover Problem (9 min).mp4 13.4 MB
17 Faster Exact Algorithms for NP-Complete Problems/17 - 2 - Smarter Search for Vertex Cover I (10 min).mp4 14.8 MB
17 Faster Exact Algorithms for NP-Complete Problems/17 - 3 - Smarter Search for Vertex Cover II (8 min).mp4 10.9 MB
17 Faster Exact Algorithms for NP-Complete Problems/17 - 4 - The Traveling Salesman Problem (15 min).mp4 22.0 MB
17 Faster Exact Algorithms for NP-Complete Problems/17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).mp4 18.3 MB
18 Approximation Algorithms for NP-Complete Problems/18 - 1 - A Greedy Knapsack Heuristic (14 min).mp4 19.7 MB
18 Approximation Algorithms for NP-Complete Problems/18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min).mp4 9.4 MB
18 Approximation Algorithms for NP-Complete Problems/18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min).mp4 13.0 MB
18 Approximation Algorithms for NP-Complete Problems/18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).mp4 16.2 MB
18 Approximation Algorithms for NP-Complete Problems/18 - 5 - Knapsack via Dynamic Programming, Revisited (10 min).mp4 13.9 MB
18 Approximation Algorithms for NP-Complete Problems/18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).mp4 19.6 MB
19 Local Search Algorithms/19 - 1 - The Maximum Cut Problem I (9 min).mp4 13.0 MB
19 Local Search Algorithms/19 - 2 - The Maximum Cut Problem II (9 min).mp4 13.5 MB
19 Local Search Algorithms/19 - 3 - Principles of Local Search I (9 min).mp4 12.8 MB
19 Local Search Algorithms/19 - 4 - Principles of Local Search II (10 min).mp4 15.2 MB
19 Local Search Algorithms/19 - 5 - The 2-SAT Problem (15 min).mp4 20.6 MB
19 Local Search Algorithms/19 - 6 - Random Walks on a Line (16 min).mp4 22.4 MB
19 Local Search Algorithms/19 - 7 - Analysis of Papadimitriou-'s Algorithm (15 min).mp4 22.7 MB
2 Selected Review From Part 1/2 - 1 - About the Course [Part I Review - Optional] (17 min).mp4 19.2 MB
2 Selected Review From Part 1/2 - 2 - Why Study Algorithms- [Part I Review - Optional] (19 min).mp4 21.2 MB
2 Selected Review From Part 1/2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp4 19.8 MB
2 Selected Review From Part 1/2 - 4 - Big-Oh Notation [Part I Review - Optional] (4 min).mp4 4.6 MB
2 Selected Review From Part 1/2 - 5 - Graph Representations [Part I Review - Optional] (14 min).mp4 15.2 MB
2 Selected Review From Part 1/2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).mp4 25.5 MB
2 Selected Review From Part 1/2 - 7 - Dijkstra-'s Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4 23.0 MB
2 Selected Review From Part 1/2 - 8 - Data Structures- Overview [Part I Review - Optional] (5 min).mp4 5.1 MB
2 Selected Review From Part 1/2 - 9 - Heaps- Operations and Applications [Part I Review - Optional] (18 min).mp4 20.4 MB
20 The Wider World of Algorithms/20 - 1 - Stable Matching [Optional] (15 min).mp4 23.6 MB
20 The Wider World of Algorithms/20 - 2 - Matchings, Flows, and Braess-'s Paradox [Optional] (14 min).mp4 22.0 MB
20 The Wider World of Algorithms/20 - 3 - Linear Programming and Beyond [Optional] (11 min).mp4 17.7 MB
20 The Wider World of Algorithms/20 - 4 - Epilogue (1 min).mp4 1.9 MB
3 Introduction to Greedy Algorithms/3 - 1 - Introduction to Greedy Algorithms (13 min).mp4 18.9 MB
3 Introduction to Greedy Algorithms/3 - 2 - Application- Optimal Caching (11 min).mp4 15.7 MB
4 A Scheduling Application/4 - 1 - Problem Definition (6 min).mp4 8.2 MB
4 A Scheduling Application/4 - 2 - A Greedy Algorithm (13 min).mp4 18.0 MB
4 A Scheduling Application/4 - 3 - Correctness Proof - Part I (7 min).mp4 9.7 MB
4 A Scheduling Application/4 - 4 - Correctness Proof - Part II (5 min).mp4 6.5 MB
4 A Scheduling Application/4 - 5 - Handling Ties [Advanced - Optional] (7 min).mp4 10.1 MB
5 Prim's Minimum Spanning Tree Algorithm/5 - 1 - MST Problem Definition (11 min).mp4 15.7 MB
5 Prim's Minimum Spanning Tree Algorithm/5 - 2 - Prim-'s MST Algorithm (8 min).mp4 10.5 MB
5 Prim's Minimum Spanning Tree Algorithm/5 - 3 - Correctness Proof I (16 min).mp4 19.9 MB
5 Prim's Minimum Spanning Tree Algorithm/5 - 4 - Correctness Proof II (8 min).mp4 10.6 MB
5 Prim's Minimum Spanning Tree Algorithm/5 - 5 - Proof of Cut Property [Advanced - Optional] (12 min).mp4 15.7 MB
5 Prim's Minimum Spanning Tree Algorithm/5 - 6 - Fast Implementation I (15 min).mp4 20.6 MB
5 Prim's Minimum Spanning Tree Algorithm/5 - 7 - Fast Implementation II (10 min).mp4 13.8 MB
6 Kruskals Minimum Spanning Tree Algorithm/6 - 1 - Kruskal-'s MST Algorithm (8 min).mp4 11.6 MB
6 Kruskals Minimum Spanning Tree Algorithm/6 - 2 - Correctness of Kruskal-'s Algorithm (9 min).mp4 12.9 MB
6 Kruskals Minimum Spanning Tree Algorithm/6 - 3 - Implementing Kruskal-'s Algorithm via Union-Find I (9 min).mp4 13.5 MB
6 Kruskals Minimum Spanning Tree Algorithm/6 - 4 - Implementing Kruskal-'s Algorithm via Union-Find II (14 min).mp4 19.8 MB
6 Kruskals Minimum Spanning Tree Algorithm/6 - 5 - MSTs- State-of-the-Art and Open Questions [Advanced - Optional] (9 min).mp4 14.9 MB
7 Clustering/7 - 1 - Application to Clustering (12 min).mp4 15.9 MB
7 Clustering/7 - 2 - Correctness of Clustering Algorithm (10 min).mp4 12.5 MB
8 Advanced Union-Find/8 - 1 - Lazy Unions [Advanced - Optional] (10 min).mp4 16.0 MB
8 Advanced Union-Find/8 - 2 - Union-by-Rank [Advanced - Optional] (12 min).mp4 19.1 MB
8 Advanced Union-Find/8 - 3 - Analysis of Union-by-Rank [Advanced - Optional] (15 min).mp4 23.4 MB
8 Advanced Union-Find/8 - 4 - Path Compression [Advanced - Optional] (15 min).mp4 22.6 MB
8 Advanced Union-Find/8 - 5 - Path Compression- The Hopcroft-Ullman Analysis I [Advanced - Optional] (9 min).mp4 14.3 MB
8 Advanced Union-Find/8 - 6 - Path Compression- The Hopcroft-Ullman Analysis II [Advanced - Optional] (12 min).mp4 18.0 MB
8 Advanced Union-Find/8 - 7 - The Ackermann Function [Advanced - Optional] (17 min).mp4 23.7 MB
8 Advanced Union-Find/8 - 8 - Path Compression- Tarjan-'s Analysis I [Advanced - Optional] (14 min).mp4 21.8 MB
8 Advanced Union-Find/8 - 9 - Path Compression- Tarjan-'s Analysis II [Advanced - Optional] (14 min).mp4 20.0 MB
9 Huffman Codes/9 - 1 - Introduction and Motivation (9 min).mp4 12.5 MB
9 Huffman Codes/9 - 2 - Problem Definition (10 min).mp4 16.1 MB
9 Huffman Codes/9 - 3 - A Greedy Algorithm (17 min).mp4 25.9 MB
9 Huffman Codes/9 - 4 - A More Complex Example (4 min).mp4 5.8 MB
9 Huffman Codes/9 - 5 - Correctness Proof I (10 min).mp4 14.0 MB
9 Huffman Codes/9 - 6 - Correctness Proof II (13 min).mp4 17.6 MB

==查看完整文档列表==

上一个：TV쇼 진품명품 1028회(15.12.13)HDTV H264 720p-YUKINOMATI.mp41.4 GB
下一个：uTorrent Pro v3.5.0 build 44024 Multilingual 80.4 MB

24小时热门磁力链接

本周热门磁力链接

种子标签

种子评价

优质的种子 (0) 假种子 (0) 有密码 (0) 低质量 (0) 有病毒 (0) 无法下载 (0)
欢迎对种子质量进行评价。

人气女优

北川ゆい Akira COCOLO Saiko あいだももあさのくるみあまいれもんいしかわ愛里いとうしいなうさみ恭香うちだまひろかぐやひめかとりこのみかないかほくすのき琴美クミコグレースくらもとまい（葉月ありさ）さとみ中村あみしいな純菜しのざきさとみ（三沢亜也）牧本千幸（つかもと友希）眞木ありさデヴィテラパトリックドミニカともさかまいともさか愛なごみもえひなこ

分享BT种子/磁力链接

亲，你知道吗？下载的人越多速度越快，赶快把本页面分享给好友一起下载吧^_^

磁力管家