首页
磁力链接怎么用
한국어
English
日本語
简体中文
繁體中文
Coursera- Algorithm Design & Analysis 2
文件类型
收录时间
最后活跃
资源热度
文件大小
文件数量
2015-11-1 09:27
2024-12-14 20:57
146
1.67 GB
102
磁力链接
magnet:?xt=urn:btih:2DE8E0D6399C1794E90E771F4E5F86CA2994AA72
迅雷链接
thunder://QUFtYWduZXQ6P3h0PXVybjpidGloOjJERThFMEQ2Mzk5QzE3OTRFOTBFNzcxRjRFNUY4NkNBMjk5NEFBNzJaWg==
二维码链接
种子下载(838888不存储任何种子文件)
种子下载线路1(迅雷)--推荐
种子下载线路2(比特彗星)
种子下载线路3(torcache)
3条线路均为国内外知名下载网站种子链接,内容跟本站无关!
相关链接
Coursera-
Algorithm
Design
&
Analysis
2
文件列表
1 - 1 - Application_ Internet Routing (11 min).mp4
13.85MB
1 - 2 - Application_ Sequence Alignment (9 min).mp4
11.1MB
10 - 1 - Introduction_ Weighted Independent Sets in Path Graphs (8 min).mp4
11.26MB
10 - 2 - WIS in Path Graphs_ Optimal Substructure (9 min).mp4
13.52MB
10 - 3 - WIS in Path Graphs_ A Linear-Time Algorithm (10 min).mp4
14.54MB
10 - 4 - WIS in Path Graphs_ A Reconstruction Algorithm (7 min).mp4
9.62MB
10 - 5 - Principles of Dynamic Programming (8 min).mp4
12.27MB
11 - 1 - The Knapsack Problem (10 min).mp4
14.08MB
11 - 2 - A Dynamic Programming Algorithm (10 min).mp4
13.61MB
12 - 1 - Optimal Substructure (14 min).mp4
19.54MB
12 - 2 - A Dynamic Programming Algorithm (12 min).mp4
16.71MB
13 - 1 - Problem Definition (12 min).mp4
17.19MB
13 - 2 - Optimal Substructure (9 min).mp4
13.94MB
13 - 3 - Proof of Optimal Substructure (7 min).mp4
9.86MB
13 - 4 - A Dynamic Programming Algorithm I (10 min).mp4
14.05MB
13 - 5 - A Dynamic Programming Algorithm II (9 min).mp4
11.94MB
14 - 1 - Single-Source Shortest Paths, Revisted (11 min).mp4
15.15MB
14 - 2 - Optimal Substructure (11 min).mp4
15.27MB
14 - 3 - The Basic Algorithm I (9 min).mp4
12.11MB
14 - 4 - The Basic Algorithm II (11 min).mp4
13.61MB
14 - 5 - Detecting Negative Cycles (9 min).mp4
12.78MB
14 - 6 - A Space Optimization (12 min).mp4
18.34MB
14 - 7 - Internet Routing I [Optional] (11 min).mp4
16.72MB
14 - 8 - Internet Routing II [Optional] (7 min).mp4
10.68MB
15 - 1 - Problem Definition (7 min).mp4
9.48MB
15 - 2 - Optimal Substructure (12 min).mp4
16.53MB
15 - 3 - The Floyd-Warshall Algorithm (13 min).mp4
18.89MB
15 - 4 - A Reweighting Technique (14 min).mp4
19.62MB
15 - 5 - Johnson_'s Algorithm I (11 min).mp4
15.49MB
15 - 6 - Johnson_'s Algorithm II (11 min).mp4
16.86MB
16 - 1 - Polynomial-Time Solvable Problems (14 min).mp4
20.49MB
16 - 2 - Reductions and Completeness (14 min).mp4
19.86MB
16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).mp4
16.35MB
16 - 4 - Definition and Interpretation of NP-Completeness II (8 min).mp4
12.18MB
16 - 5 - The P vs. NP Question (9 min).mp4
14.28MB
16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).mp4
19.86MB
17 - 1 - The Vertex Cover Problem (9 min).mp4
12.75MB
17 - 2 - Smarter Search for Vertex Cover I (10 min).mp4
14.14MB
17 - 3 - Smarter Search for Vertex Cover II (8 min).mp4
10.37MB
17 - 4 - The Traveling Salesman Problem (15 min).mp4
21MB
17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).mp4
17.45MB
18 - 1 - A Greedy Knapsack Heuristic (14 min).mp4
18.74MB
18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min).mp4
8.93MB
18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min).mp4
12.4MB
18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).mp4
15.41MB
18 - 5 - Knapsack via Dynamic Programming, Revisited (10 min).mp4
13.22MB
18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).mp4
18.7MB
19 - 1 - The Maximum Cut Problem I (9 min).mp4
12.41MB
19 - 2 - The Maximum Cut Problem II (9 min).mp4
12.84MB
19 - 3 - Principles of Local Search I (9 min).mp4
12.22MB
19 - 4 - Principles of Local Search II (10 min).mp4
14.49MB
19 - 5 - The 2-SAT Problem (15 min).mp4
19.64MB
19 - 6 - Random Walks on a Line (16 min).mp4
21.33MB
19 - 7 - Analysis of Papadimitriou_'s Algorithm (15 min).mp4
21.62MB
2 - 1 - About the Course [Part I Review - Optional] (17 min).mp4
18.33MB
2 - 2 - Why Study Algorithms_ [Part I Review - Optional] (19 min).mp4
20.25MB
2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp4
18.86MB
2 - 4 - Big-Oh Notation [Part I Review - Optional] (4 min).mp4
4.36MB
2 - 5 - Graph Representations [Part I Review - Optional] (14 min).mp4
14.48MB
2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).mp4
24.36MB
2 - 7 - Dijkstra_'s Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4
21.92MB
2 - 8 - Data Structures_ Overview [Part I Review - Optional] (5).mp4
4.89MB
2 - 9 - Heaps_ Operations and Applications [Part I Review - Optional] (18).mp4
19.49MB
20 - 1 - Stable Matching [Optional] (15 min).mp4
22.55MB
20 - 2 - Matchings, Flows, and Braess_'s Paradox [Optional] (14 min).mp4
20.96MB
20 - 3 - Linear Programming and Beyond [Optional] (11 min).mp4
16.84MB
20 - 4 - Epilogue (1 min).mp4
1.79MB
3 - 1 - Introduction to Greedy Algorithms (13 min).mp4
18.04MB
3 - 2 - Application_ Optimal Caching (11 min).mp4
14.97MB
4 - 1 - Problem Definition (6 min).mp4
7.79MB
4 - 2 - A Greedy Algorithm (13 min).mp4
17.16MB
4 - 3 - Correctness Proof - Part I (7 min).mp4
9.22MB
4 - 4 - Correctness Proof - Part II (5 min).mp4
6.22MB
4 - 5 - Handling Ties [Advanced - Optional] (7 min).mp4
9.65MB
5 - 1 - MST Problem Definition (11 min).mp4
15MB
5 - 2 - Prim_'s MST Algorithm (8 min).mp4
9.99MB
5 - 3 - Correctness Proof I (16 min).mp4
19.02MB
5 - 4 - Correctness Proof II (8 min).mp4
10.14MB
5 - 5 - Proof of Cut Property [Advanced - Optional] (12 min).mp4
14.99MB
5 - 6 - Fast Implementation I (15 min).mp4
19.66MB
5 - 7 - Fast Implementation II (10 min).mp4
13.17MB
6 - 1 - Kruskal_'s MST Algorithm (8 min).mp4
11.02MB
6 - 2 - Correctness of Kruskal_'s Algorithm (9 min).mp4
12.3MB
6 - 3 - Implementing Kruskal_'s Algorithm via Union-Find I (9 min).mp4
12.9MB
6 - 4 - Implementing Kruskal_'s Algorithm via Union-Find II (14 min).mp4
18.88MB
6 - 5 - MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).mp4
14.23MB
7 - 1 - Application to Clustering (12 min).mp4
15.13MB
7 - 2 - Correctness of Clustering Algorithm (10 min).mp4
11.93MB
8 - 1 - Lazy Unions [Advanced - Optional] (10 min).mp4
15.24MB
8 - 2 - Union-by-Rank [Advanced - Optional] (12 min).mp4
18.19MB
8 - 3 - Analysis of Union-by-Rank [Advanced - Optional](15).mp4
22.29MB
8 - 4 - Path Compression [Advanced - Optional] (15).mp4
21.51MB
8 - 5 - Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].mp4
13.66MB
8 - 6 - Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].mp4
17.17MB
8 - 7 - The Ackermann Function [Advanced - Optional](17 min).mp4
22.64MB
8 - 8 - Path Compression_ Tarjan_'s Analysis I [Advanced - Optional].mp4
20.78MB
8 - 9 - Path Compression_ Tarjan_'s Analysis II [Advanced - Optional].mp4
19.09MB
9 - 1 - Introduction and Motivation (9 min).mp4
11.89MB
9 - 2 - Problem Definition (10 min).mp4
15.35MB
9 - 3 - A Greedy Algorithm (17 min).mp4
24.7MB
9 - 5 - Correctness Proof I (10 min).mp4
13.3MB
9 - 6 - Correctness Proof II (13 min).mp4
16.75MB
友情提示
不会用的朋友看这里 把磁力链接复制到离线下载,或者bt下载软件里即可下载文件,或者直接复制迅雷链接到迅雷里下载! 亲,你造吗?将网页分享给您的基友,下载的人越多速度越快哦!
违规内容投诉邮箱:
[email protected]
概述 838888磁力搜索是一个磁力链接搜索引擎,是学术研究的副产品,用于解决资源过度分散的问题 它通过BitTorrent协议加入DHT网络,实时的自动采集数据,仅存储文件的标题、大小、文件列表、文件标识符(磁力链接)等基础信息 838888磁力搜索不下载任何真实资源,无法判断资源的合法性及真实性,使用838888磁力搜索服务的用户需自行鉴别内容的真伪 838888磁力搜索不上传任何资源,不提供Tracker服务,不提供种子文件的下载,这意味着838888磁力搜索 838888磁力搜索是一个完全合法的系统