Skip to main content
Graph
Search
fr
|
en
Switch to dark mode
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Problem-solving Strategies: Sum of N Integers (Recursive)
Graph Chatbot
Related lectures (24)
Previous
Page 2 of 3
Next
Dynamic Programming: Optimal Control
Explores Dynamic Programming for optimal control, focusing on stability, stationary policy, and recursive solutions.
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.
Dynamic Programming: Coin Change
Explores dynamic programming for efficient coin change problem solving.
Optimal Stopping Problems: Theory and Applications
Covers optimal stopping problems in applied probability and stochastic processes, focusing on theory and practical applications.
Safe Mutation in Practice
Explores safe mutation in functional programming through lazy evaluation, object invariants, and efficient caching functions.
Computation & Algorithms II: Binary Search and Merge Sort
Explores binary search, merge sort, recursion in algorithms, Fibonacci numbers, and dynamic programming.
Properties of Subtraction
Covers the properties of subtraction and the distributivity of multiplication.
Markov Decision Processes: Foundations of Reinforcement Learning
Covers Markov Decision Processes, their structure, and their role in reinforcement learning.
Matrix Multiplication and Divide-and-Conquer Techniques
Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.
Dynamic Programming: Rod Cutting and Matrix Chain Multiplication
Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.
