Skip to content

Uni Noter

Course

Initializing search

mathiasandresen/uni-notes

Forside
3 semester
4 semester
5 semester
6 semester
7 semester
8 semester

Uni Noter

mathiasandresen/uni-notes

Forside
3 semester
3 semester
4 semester
4 semester
5 semester
5 semester
6 semester
6 semester
- Index
- AALG
  AALG
  - Course
  - Dynamic Programming
  - All-pairs Shortest Paths (Dynamic Programming)
  - Flow Networks and Maximum Flow
  - Greedy Algorithms
  - Amortized Analysis
  - Computational Geometry Algorithms: Sweeping Techniques
  - Computational Geometry Data Structures: Range Searching
  - Multithreaded Algorithms
  - Approximation for NP-complete Problems
  - Backtracking and Branch-and-Bound
  - Guides
    Guides
    
    Amortized Analysis
    
    Approximation and Parallelism
    
    Flow Networks
    
    Graphs
    
    Others
    
    Range Queries and Trees
    
    Sweeping
    
    Year based old
    Year based old
    
    2015
    
    2016
    
    2017
- DBS
  DBS
7 semester
7 semester
8 semester
8 semester
- Index
- MDLS
  MDLS
  - Introduction
- mHCI
  mHCI
- sP
  sP

MI - Machine Intelligence¶

Moodle side:

https://www.moodle.aau.dk/course/view.php?id=31435

Last update: January 12, 2020

Made with Material for MkDocs