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
Dynamic Programming: How Many Ways to Make Change
Graph Chatbot
Related lectures (30)
Previous
Page 3 of 3
Next
Optimization Methods
Covers the Newton's local method in Python using NumPy for optimization.
Dynamic Programming: Optimal Decision Making
Explores dynamic programming for optimizing decision-making processes over time, using real-world examples like oil extraction and stock trading.
Optimization and Simulation
Explores optimization techniques like Metropolis-Hastings and Simulated Annealing through Markov chains and stationary distributions.
Dynamic Programming: Introduction and Fibonacci Numbers
Introduces Dynamic Programming, focusing on saving computation by remembering previous calculations and applying it to solve optimization problems efficiently.
Dataflow Analysis: Optimization
Explores dataflow analysis for optimization, including equations solving, live variables, reaching definitions, and very busy expressions.
Dynamic Programming: Steinitz Sequence
Explores dynamic programming with the Steinitz sequence to optimize solutions efficiently.
Propulsion by Looping: Understanding the Physics
Explores the physics of propulsion by looping and the critical points for effective looping.
Choosing a Step Size
Explores choosing a step size in optimization on manifolds, including backtracking line-search and the Armijo method.
Dynamic Programming: Fibonacci Numbers
Covers dynamic programming with a focus on Fibonacci numbers and efficient calculation algorithms.
Dynamic Programming: Fibonacci Numbers
Covers dynamic programming with a focus on Fibonacci numbers and the rod cutting problem.
