Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Ford-Fulkerson: a worked example
Graph Chatbot
Related lectures (32)
Previous
Page 2 of 4
Next
Branch & Bound: Optimization
Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Optimization Methods
Covers the Newton's local method in Python using NumPy for optimization.
Search Algorithms: Abductive Reasoning
Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.
Choosing a Step Size
Explores choosing a step size in optimization on manifolds, including backtracking line-search and the Armijo method.
Dynamic Programming: Bellman-Ford and Dijkstra
Explores dynamic programming with Bellman-Ford, Dijkstra, greedy strategies, and activity scheduling problems.
Optimization algorithms
Covers optimization algorithms, focusing on Proximal Gradient Descent and its variations.
Network Flows and LP Formulations
Explains network flows, LP formulations, simplex method, duality, and practical applications.
Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search
Explores solving Connect Four using game theory algorithms and compares Alpha-Beta pruning with Monte-Carlo tree search.
Multi-arm Bandits
Discusses algorithms for balancing exploration and exploitation in decision-making processes.
