Whenever you are faced with a problem it is normal to try to find a generic solution and then you implement that solution in code. But some problems might be too complex to solve by humans (and even engineers). Imagine you are a traveling salesman, about to visit 10 cities in Europe. You can visit them in any order. What’s the cheapest route? To find this out, we could use dynamic programming to let the computer solve the problem for us and just give us a result.

Comments

Comments are closed.

Challenging for my rusty math skills, but worthy

This was not an easy subject, but I liked the way Tobias handled it. My mind was completely numb at the end of the tallk from trying to understand what was being said, but I liked the way the problems were simplified to a point where they were sort of understandable.

Rated 4

dParadiz at 20:29 on 12 May 2018

Good intro. Dynamic programming could be demistifyed, by show that it can be as hard as calling a function.

Rated 5

Ani Sinanaj at 22:32 on 12 May 2018

The presentation was so good that it inspired me to apply dynamic programming and also study graphs

Liked it :) Maybe a 25min slot is a bit to short (or a bit to steep) for people to reactivate their rusty math :)

Wow, it is since the university (a few decades) that I no longer felt these terms, but well used to present the problem.