Lectures related to Transhipment and Shortest Paths

Explores abductive reasoning, search algorithms, and heuristic search for problem-solving.

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

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

Explores solving shortest path problems with the Bellman-Ford algorithm and negative cost cycles.

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

Graph Algorithms: Ford-Fulkerson and Strongly Connected Components

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Group Membership and View Synchrony

Explores group membership and view synchrony in distributed systems, ensuring accurate knowledge and coordinated views.

Entropy and Algorithms: Applications in Sorting and Weighing

Covers the application of entropy in algorithms, focusing on sorting and decision-making strategies.