Lectures related to Shortest Path Algorithm

Shortest path, Dijkstra's algorithm MOOC: Optimization: principles and algorithms - Network and discrete optimization

Explores Dijkstra's algorithm for finding the shortest path in a network with non-negative costs and permanent labels.

Presents a quiz on estimating return variables in Monte-Carlo methods.

Covers the basic functions of AutoCAD for creating a vault plan, including tools, properties, and parametric modifications.

Epidemic Spreading Models

Covers classical models of epidemic spreading and dynamics on networks with examples.

AutoCAD Functions: Various Tools and Features

Covers a range of AutoCAD functions, including tools for drawing and dimension modification.

Spatial relations and topology MOOC: Geographical Information Systems 1

Covers spatial relations and topology in GIS, emphasizing the importance of topological consistency in spatial analysis.

Search and Routing Protocols

Explores unstructured and structured search and routing protocols, emphasizing the importance of network structure assumptions and introducing the 'Bubble Storm' algorithm.

Descent methods and line search: Finiteness of the line search algorithm MOOC: Optimization: principles and algorithms - Unconstrained nonlinear optimization

Explores the Wolfe conditions for line search algorithms and proves the finiteness of the line search parameter.

Network Security - TCP security

Covers the limitations of IP and the Transmission Control Protocol (TCP), including security considerations.

Form and Function of Complex Systems

Delves into the form and function of complex systems, emphasizing the interplay between 'mass' and 'transport networks' in various systems.

Dynamic Communication Networks: Structures and Predictability

Explores fundamental structures of dynamic communication networks, including predictability in human mobility and network communities.

Network Coding: An Instant Primer

Introduces network coding, explaining its benefits, implications, and practical applications in networking systems.

Dynamic Programming: Pascal's Triangle & Floyd's Algorithm

Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.

Dynamic Programming: Shortest Paths Algorithms

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.

Documenta Fifteen: Recap and Artistic Direction

Explores the genesis of the documenta concept and showcases artworks while discussing themes of collective care, sustainability, and community in art.

Handling Network Data

Explores handling network data, including types of graphs, real-world network properties, and node importance measurement.

The Transhipment and Transportation Problems MOOC: Optimization: principles and algorithms - Network and discrete optimization

Covers the transhipment and transportation problems in electricity distribution in Switzerland.

Network Simulation: Spontaneous Activity and Validation Log in to Mediaspace to watch this video

Covers spontaneous brain network activity, neural simulation, and validation, emphasizing the importance of in-vitro and in-vivo conditions for accurate network modeling.

Radiation and Antennas: Orthogonal Herz Dipole Network Log in to Mediaspace to watch this video

Covers the concept of radiation and antennas in orthogonal Herz dipole networks.

Statistical Analysis of Network Data: Noisy Sampled Networks Log in to Mediaspace to watch this video

Explores statistical analysis of network data, covering noisy sampled networks, likelihood estimation, multilayer networks, and directed networks.