Lecture
Distributed Intelligent Systems: Self-Organization and Foraging Strategies
Related lectures (32)
Ant Colony Optimization: Routing and Optimization
Explores Ant Colony Optimization (ACO) for routing and optimization, discussing constructive heuristics, local search, pheromone mechanisms, and real-world applications.
Semi-Definite Programming
Covers semi-definite programming and optimization over positive semidefinite cones.
Optimisation in Energy Systems
Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.
Optimization Methods: Theory Discussion
Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.
Simplex Algorithm
Covers the Simplex algorithm for function minimization with linear constraints.
Thermodynamic Properties: Equations and Models
Explains thermodynamic properties, equations of state, and mixture rules for energy systems modeling.
Sparsest Cut: ARV Theorem
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Trust region methods: framework & algorithms
Covers trust region methods, focusing on the framework and algorithms.
Distributed Intelligent Systems: General Logistics and Course Overview
Covers the general logistics, course rationale, prerequisites, organization, credits, workload, grading, and course content, including swarm intelligence, foraging strategies, and collective phenomena.