Abstract: This simple technique that every programmer should know can simplify certain types of problems tremendously, allowing us to find an optimal solution to difficult problems quickly and easily using a mathematical process called Dynamic Programming (not to be confused with Dynamic Languages or Functional Programming). In this session, we will run through examples of using this technique to solve several problems, both "on paper" and in code.
Prerequisites: Code examples are in C# so a basic knowledge of C# and its metaphors is helpful.
Dynamic Optimization - One Algorithm All Programmers Should Know
Type: Breakout session
Speaker: Barry S. Stahl
Technical level: Intermediate
Abstract: This simple technique that every programmer should know can simplify certain types of problems tremendously, allowing us to find an optimal solution to difficult problems quickly and easily using a mathematical process called Dynamic Programming (not to be confused with Dynamic Languages or Functional Programming). In this session, we will run through examples of using this technique to solve several problems, both "on paper" and in code.
Prerequisites: Code examples are in C# so a basic knowledge of C# and its metaphors is helpful.