Procedures of this type can provide polynomial time solutions to such problems as finding optimal places to insert line breaks in a body of text, finding the largest common substring of two strings, and the integer knapsack problem.  They can provide vast improvements over exhaustive search algorithms by caching the answers to intermediate computations.  FTP, name this type of algorithm that generally uses recurrence rela
Procedures of this type can provide polynomial time solutions to such problems as finding optimal places to insert line breaks in a body of text, finding the largest common substring of two strings, and the integer knapsack problem.  They can provide vast improvements over exhaustive search algorithms by caching the answers to intermediate computations.  FTP, name this type of algorithm that generally uses recurrence relations and the principle of optimality to solve optimization problems by first solving related subproblems, and which often works where greedy algorithms fail.
Procedures of this type can provide polynomial time solutions to such problems as finding optimal places to insert line breaks in a body of text, finding the largest common substring of two strings, and the integer knapsack problem.  
dynamic algorithms (or dynamic programming, I suppose)