Dynamic programming: Difference between revisions

Revision as of 07:00, 25 April 2020

Revision as of 11:38, 29 April 2020

Line 614:

* [http://www.cambridge.org/resources/0521882672/7934_kaeslin_dynpro_new.pdf A Gentle Introduction to Dynamic Programming and the Viterbi Algorithm]

* Tabled Prolog [http://www.probp.com BProlog] and [http://xsb.sourceforge.net/ XSB]

* [http{{cite web|url=https://iforsimoneyslots.orgcom/tutorial/category/dynamicfibonacci-roulette-programming/system.html |title=Online interactive dynamic programming modules]{{Deadby linkFibonacci|date=April 2020}} including, shortest path, traveling salesman, knapsack, false coin, egg dropping, bridge and torch, replacement, chained matrix products, and critical path problem.

{{optimization algorithms|combinatorial|state=expanded}}