Simple Reinforcement learning tutorials, 莫烦Python 中文AI教学

NSDI 19: Is advance knowledge of flow sizes a plausible assumption?

MIE-PAA problems and algorithms. Knapsack problem solutions: brute force, branch and bound, dynamic programming, FPTAS approximation algorithm, Simulated Annealing. MAX-SAT: Simulated Annealing