Key words
Objectives
To gain insight in solution methods for complex problems, graphs, computatonial geometry, combinatorial search and game strategies.
Topics
A survey of classical graph algorithms : depth and breadth first search, minimal spanning tree, shortest distances, acyclic graphs, flow networks and matching.
Introduction to computatonial geometry: basic techniques, convex hull, proximity, point location, geometric search, line segment intersection.
Introduction to combinatorial search and game strategies, backtracking, branch-and-bound, minimax, a-b pruning.
Prerequisites
Final Objectives
Materials used
Handouts
Study costs
Study guidance
Teaching Methods
Lectures
Assessment
Lecturer(s)
Jan CNOPS - Helga NAESSENS - Wijnand SCHEPENS - Rudy STOOP
|
|
