Design and Analysis of Algorithms
Learn algorithm design and analysis, covering sorting, graphs, dynamic programming, and complexity theory. Gain practical skills in efficient problem-solving and algorithm implementation.
Maximization LPP Problem Using Graphical Solution - Example 1 - Operational Research
Comprehensive tutorial on solving Linear Programming Problem maximization using graphical method, covering problem conversion, constraint plotting, feasible region identification, and profit maximization.
Stanford Seminar - Recent Progress in Verifying Neural Networks, Zico Kolter
Explore recent advancements in neural network verification, focusing on robustness and safety validation. Learn about innovative approaches that significantly speed up the verification process for medium-sized networks.
Convex Optimization I - Lecture 6
Explore advanced convex optimization techniques with Stanford's Stephen Boyd. Dive deep into mathematical concepts and practical applications in this comprehensive lecture series.
Convex Optimization I - Lecture 8
Explore advanced convex optimization techniques with Stanford's Stephen Boyd, focusing on practical applications and theoretical foundations in electrical engineering and beyond.
Convex Optimization I - Lecture 7
Explore advanced convex optimization techniques with Stanford's Stephen Boyd, focusing on practical applications and theoretical foundations in electrical engineering and beyond.
Convex Optimization I - Lecture 5
Explore advanced optimization techniques with Professor Stephen Boyd, focusing on convex problems and their applications in engineering and beyond.
Convex Optimization I - Lecture 4
Explore advanced convex optimization techniques with Stanford's Professor Stephen Boyd, focusing on practical applications in engineering and data science.
Convex Optimization I - Lecture 10
Explore advanced convex optimization techniques with Stanford's Stephen Boyd. Delve into complex mathematical concepts and their practical applications in engineering and data science.
Convex Optimization I - Lecture 9
Explore advanced convex optimization techniques with Stanford's Stephen Boyd, focusing on practical applications and theoretical foundations in electrical engineering and beyond.
Convex Optimization I - Lecture 13
Explore advanced convex optimization techniques with Stanford's Stephen Boyd, focusing on practical applications and theoretical foundations in electrical engineering and beyond.
Convex Optimization I - Lecture 17
Explore advanced convex optimization techniques with Stanford's Stephen Boyd, focusing on practical applications and theoretical foundations in electrical engineering and beyond.
Convex Optimization I - Lecture 16
Explore advanced convex optimization techniques with Stanford's Stephen Boyd, focusing on practical applications and theoretical foundations in electrical engineering and beyond.
Convex Optimization I - Lecture 15
Explore advanced convex optimization techniques with Stanford's Stephen Boyd, covering key concepts and applications in electrical engineering and beyond.
Convex Optimization I - Lecture 3
Explore advanced convex optimization techniques with Stanford's Stephen Boyd. Dive deep into mathematical concepts and practical applications in this comprehensive lecture series.
Convex Optimization I - Lecture 1
Explore fundamental concepts of convex optimization with Stanford's Stephen Boyd. Gain insights into this powerful mathematical technique for solving complex problems efficiently.
Convex Optimization I - Lecture 12
Explore advanced convex optimization techniques with Stanford's Stephen Boyd. Delve into complex mathematical concepts and their practical applications in engineering and data science.
Convex Optimization I - Lecture 11
Explore advanced convex optimization techniques with Stanford's Professor Stephen Boyd, focusing on practical applications and theoretical foundations in electrical engineering.
Optimal Control
Comprehensive exploration of optimization techniques, from unconstrained problems to dynamic optimization, covering linear and non-linear programming, optimal control, and robust stability analysis.
Computer Algorithms - 2
The course discusses efficient algorithms from a large number of domains. This course assumes the knowledge of data structures, the knowledge big-O notation and the concept of time and space complexity of an algorithm.
Constrained and Unconstrained Optimization
Comprehensive exploration of optimization techniques, covering linear and nonlinear programming, integer programming, transportation problems, and multi-objective decision making.