Dynamic programming builds solutions from solutions to simpler subproblems. It's closely allied to recursion, but dynamic programming algorithms are formulated as iteration usually over a very regular datastructure.
3
votes
0answers
243 views
Dynamic programming in Bin packing
Problem: Given a list L of objects of possible sizes from set S={1,2,4,8} and unlimited supply of bins of sizes 16 each and we have to use minimum possible numbers of bins to pack all objects of L.
I ...
3
votes
0answers
230 views
Help/suggestions for Parallel assembly line scheduling (Dynamic programming)
I am working on a problem similar to the assembly line scheduling by dynamic programming.The issue is that unlike the classic problem where we have predefined stations now I only have information ...
0
votes
0answers
64 views
scrabble solving with maximum score
I was asked a question
You are given a list of characters, a score associated with each character and a dictionary of valid words ( say normal English dictionary ). you have to form a word ...
-4
votes
0answers
18 views
Domino Solitaire Algorithm using Memoization
Domino Solitaire Problem :
programmers.stackexchange.com/questions/180524/domino-solitaire-algorithm/296514#296514
Does Memoized solution for this problem exist?
If so can somebody share the code?
...
