Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Integer Program Formulation
Graph Chatbot
Related lectures (53)
Graph Coloring: Random vs Symmetrical
Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.
Computational Complexity
Covers the basics of computational complexity, including big O notation and complexity classes.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Algorithmic Complexity: Definition and Examples
Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.
Implementation Research: Concepts and Scope
Explores Implementation Research, addressing challenges in implementing health interventions and developing effective strategies for infectious diseases of poverty.
Computational Complexity: Theory and Applications
Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.
Linear Systems: Convergence and Methods
Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.
Untitled
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Algorithmic Complexity: Travel Time Analysis
Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.
Statistical Physics of Clusters
Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.
Implementation Strategies: Specifying and Operationalizing
Discusses a systematic approach for specifying and operationalizing implementation strategies.
Coin Rendering: Part 1
MOOC: Information, Computation, Communication: Introduction to computational thinking
Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.
Digital Solutions in Humanitarian Sector
Explores digital solutions in the humanitarian sector, empowering viewers to form opinions and make informed decisions.
Linear Programming: Optimization and Constraints
Log in to Mediaspace to watch this video
Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.
Reformulating Problems: Tools and Intuition
Log in to Mediaspace to watch this video
Focuses on open problems and the importance of reformulating problems with better tools and intuition.
Convex Polyhedra and Linear Programs
Log in to Mediaspace to watch this video
Explores convex polyhedra, linear programs, and their optimization importance.
Linear Algebra: Efficiency and Complexity
Log in to Mediaspace to watch this video
Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.
Cutset Formulation: MST Problem
Log in to Mediaspace to watch this video
Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.
Optimization Algorithms
Log in to Mediaspace to watch this video
Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.
Previous
Page 1 of 3
Next
