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
Concept
Knapsack problem
Formal sciences
Theoretical computer science
Theory of computation
Computational complexity th...
Related lectures (29)
Graph Chatbot
Login to filter by course
Login to filter by course
Reset
Previous
Page 2 of 3
Next
Dining Philosophers Problem
Discusses algorithms to prevent starvation and maximize philosophers eating simultaneously.
Manopt: Optimization on Manifolds
Introduces Manopt, a toolbox for optimization on manifolds, covering gradient and Hessian checks, solver calls, and manual caching.
Knapsack Problem: Dynamic Programming
Explores dynamic programming for the Knapsack Problem, optimizing weight accumulation and profit subsets efficiently.
Hidden Subgroup Algorithm
Continues the discussion on Simon's hidden subgroup problem, focusing on finding a basis.
Numerical Analysis: Stability in ODEs
Covers the stability analysis of ODEs using numerical methods and discusses stability conditions.
Optimization and Simulation
Explores greedy heuristics in optimization, integrality constraints, and comparison of optimization methods.
Optimisation in Energy Systems
Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.
Generalization of the Model Problem
Covers the generalization of the model problem in structural mechanics and explores equilibrium equations and the link between normal force and displacement.
Knapsack Problem: Optimization and Traveling Salesman
Explores the knapsack problem and the traveling salesman problem with a focus on optimization algorithms.
Optimization and Simulation: Bayesian Inference
Explores Bayesian inference, knapsack problem, and prediction using Markov Chain Monte Carlo methods.
