No background for this project. To contrast with mini-project 2, this is much more open-ended. As
background, review Chapter 15.
2.1 Problem Selection
Select a particular problem that can be solved with dynamic programming that is not covered in
Chapters 15, 22, 23, 24, 25, or 26 of the textbook (if you are having trouble finding something, come
talk to me).
An algorithm is not a problem. A particular named algorithm like solves a particular problem
(Floyd-Warshall, for instance, solves the all pairs shortest path problem).
2.2 Literature Review
Prepare a literature review of this topic. Using scholarly sources (we will talk about this at some
point), introduce the problem at hand. If possible, describe the history of solutions to this problem.
How have solutions improved over time? What is used “in practice” today? Does there seem to be
ongoing work at solving this particular problem?
Next, find and select several (if possible) solutions (and/or different implementations of similar
solutions) to this problem. At least one of these must be a dynamic programming-based solution.
Describe and summarize these solutions. Depending on the problem, it may also be interesting to
note who the authors are. Are they computer scientists or primarily researchers in some other field?
Finally, compare and contrast your selected solutions to one another. What similarities and differ
ences are there? Are there significant differences? Things in common among some papers/implementations?
If considering similar solutions to the problem, what implementation differences are there? Are there
results we can infer from these? Do we see anything unexpected or unique in any of the solutions?
Are there different disciplines interested in this same problem? Why (or why not?)
本网站支持淘宝 支付宝 微信支付 paypal等等交易。如果不放心可以用淘宝交易！
E-mail: email@example.com 微信:itcsdx