![](images/graphics/blank.gif)
Bài giảng Phân tích và thiết kế thuật toán nâng cao
-
Bài báo "Tối ưu hệ giằng của khung thép phi tuyến sử dụng phương pháp thiết kế nâng cao và thuật toán tiến hóa" nhằm tối ưu hệ giằng của khung thép phi tuyến có xét đến sự chảy dẻo của vật liệu. Trong đó, phương pháp thiết kế nâng cao được sử dụng để phân tích các ứng xử của kết cấu. Phương pháp này sử dụng hàm ổn định thay vì hàm nội suy bậc ba Hermit để xấp xỉ trường chuyển vị của phần tử dầm và cột. Mời các bạn cùng tham khảo!
8p
dathienlang1012
03-05-2024
2
0
Download
-
Advanced Algorithms Analysis and Design - Lecture 1: Introduction. In this lecture we will cover the following: what is algorithm; designing techniques; model of computation; algorithms as a technology; algorithms and other technologies; importance of algorithms; difference in users and developers;...
20p
andromedashun
26-05-2022
20
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 2: Mathematical Tools for Design and Analysis of Algorithms. In this lecture we will cover the following a sequence of mathematical tools include: sets, sequences, order pairs, cross product, relation, functions, operators over above structures, conclusion,...
26p
andromedashun
26-05-2022
7
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 3: Logic and Proving Techniques. In this lecture we will cover the following: tools used for proving algorithms; propositional logic; predicate logic; proofs using; probability as analysis tool; series and summation etc;...
25p
andromedashun
26-05-2022
8
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 4: Mathematical Induction. In this lecture we will cover the following: what is mathematical induction; why is mathematical induction valid; proving problems using induction; proving hard problems using induction; strong mathematical induction; proving problems using strong induction;...
25p
andromedashun
26-05-2022
10
2
Download
-
Advanced Algorithms Analysis and Design - Lecture 5: Strong mathematical induction. In this lecture we will cover the following: generalization of Demargon’s laws; strong mathematical induction; converting problems to be proved using strong mathematical induction; proving problems using strong induction;...
15p
andromedashun
26-05-2022
15
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 8: Recurrence relations. In this lecture we will cover the following: general homogenous recurrences; non-homogenous recurrence relations; characteristics of various type of non-homogenous recurrence relations; solution to various non-homogenous recurrence relations;...
36p
andromedashun
26-05-2022
9
2
Download
-
Advanced Algorithms Analysis and Design - Lecture 19: 0-1 knapsack problem using dynamic programming
Advanced Algorithms Analysis and Design - Lecture 19: 0-1 knapsack problem using dynamic programming. In this lecture we will cover the following: 0-1 knapsack problem; problem analysis; algorithm using dynamic programming; time complexity; generalization, variations and applications;...
36p
andromedashun
26-05-2022
9
2
Download
-
Advanced Algorithms Analysis and Design - Lecture 6: Fibonacci sequences. In this lecture we will cover the following: fibonacci problem and its sequence; construction of mathematical model; explicit formula computing fibonacci numbers; recursive algorithms; generalizations of rabbits problem and constructing its mathematical models;...
34p
andromedashun
26-05-2022
6
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 7: Recurrence relations. In this lecture we will cover the following: recursive mathematical models; solving recurrence relations; first order linear homogenous recurrence relations, with constant coefficients; second order linear homogenous recurrence relations, constant coefficients; general homogenous recurrences;...
40p
andromedashun
26-05-2022
6
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 9: Further techniques solving recurrence relations
Advanced Algorithms Analysis and Design - Lecture 9: Further techniques solving recurrence relations. In this lecture we will cover the following: assumptions in solving recurrence; the substitution method; the recursion tree method; the master theorem;...
53p
andromedashun
26-05-2022
10
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 10: Time complexity of algorithms. In this lecture we will cover the following: major factors in algorithms design; complexity analysis; growth of functions; asymptotic notations; usefulness of notations; various examples explaining each concept;...
37p
andromedashun
26-05-2022
10
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 11: Relations over asymptotic notations. In this lecture we will cover the following: reflexivity relations; symmetry; transitivity relation; transpose symmetry; some other standard notations; standard logarithms notations;...
28p
andromedashun
26-05-2022
8
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 12: Design of algorithms using Brute Force Approach. In this lecture we will cover the following: checking primality; sorting sequence of numbers; Knapsack problem; closest pair in 2-D, 3-D and n-D; finding maximal points in n-D;...
35p
andromedashun
26-05-2022
15
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 13: Designing algorithms using Brute Force and Divide & Conquer approaches. In this lecture we will cover the following: finding closest pair in 2-D; improved version finding closest pair in 2-D; generalization in 3-D and then n-D; a general Divide and Conquer approach; merge sort algorithm;...
20p
andromedashun
26-05-2022
9
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 14: Designing algorithms using Divide & Conquer approach. In this lecture we will cover the following: a general divide and conquer approach; merge sort algorithm; finding maxima in 1-D, and 2-D; finding closest pair in 2-D;...
43p
andromedashun
26-05-2022
12
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 15: Dynamic programming for solving optimization problems. In this lecture we will cover the following: optimizations problem; steps in development of dynamic algorithms; why dynamic in optimization problem; introduction to catalan numbers; chain-matrix multiplication; problem analysis;...
30p
andromedashun
26-05-2022
15
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 16: Chain matrix multiplication problem using dynamic programming. In this lecture we will cover the following: chain-matrix multiplication; problem analysis, notations, dynamic algorithm, time complexity; generalization and applications;...
28p
andromedashun
26-05-2022
6
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 17: Assembly-line scheduling problem. In this lecture we will cover the following: assembly line scheduling problem; problem analysis; algorithm using dynamic programming; time complexity; generalization and applications;...
24p
andromedashun
26-05-2022
6
1
Download
-
Advanced Algorithms Analysis and Design - Lecture 18: 2-line assembly scheduling problem. In this lecture we will cover the following: 2-line assembly scheduling algorithm using dynamic programming; time complexity; n-line assembly problem; brute force analysis; n-line assembly scheduling algorithm using dynamic programming;...
22p
andromedashun
26-05-2022
6
1
Download
CHỦ ĐỀ BẠN MUỐN TÌM
![](images/graphics/blank.gif)