Lecture
Dynamic Programming: How Many Ways to Make Change
Related lectures (40)
Optimization algorithms
Covers optimization algorithms, focusing on Proximal Gradient Descent and its variations.
Multi-arm Bandits
Discusses algorithms for balancing exploration and exploitation in decision-making processes.
Energy optimization strategies
Covers brainstorming options for smart operation changes, heat recovery, and PV panel performance.
Coin Change Problem
Explores the coin change problem, comparing greedy and dynamic programming algorithms for optimal solutions.
Optimisation in Energy Systems
Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.
Variance Reduction: Strategies and Applications
Discusses variance reduction techniques in stochastic simulation, focusing on allocation strategies and replica generation algorithms.
Dynamic Programming: Rod Cutting and Change Making
Explores dynamic programming through rod cutting and change making optimization problems.
Set Cover: Integrality Gap
Explores the integrality gap concept in set cover and multiplicative weights algorithms.
Simulation & Optimization: Poisson Process & Random Numbers
Explores simulation pitfalls, random numbers, discrete & continuous distributions, and Monte-Carlo integration.
Introduction to Algorithms
Explores the ingredients and selection of algorithms for different goals.