A Bellman equation is an condition associated with this technique, which is employed by the Cocke-Younger-Kasami algorithm that asks whether a string can be generated by a given context-free grammar. The Needlemna-Wunsch algorithm for nucleotide alignment also employs this technique, and this method is called stochastic if the immediate payoffs and the next state are known onyl as probabilities. An example of this method is modifying a recursive program to calculate the Fibonacci sequence so that the program stores each value of the sequence after calculating it and then reuses it if it is needed again instead of recalculating. For 10 points, name this method of problem solving, which aims to efficiently solve optimization problems which have overlapping sub-problems, and is often used to 
A Bellman equation is an condition associated with this technique, which is employed by the Cocke-Younger-Kasami algorithm that asks whether a string can be generated by a given context-free grammar. The Needlemna-Wunsch algorithm for nucleotide alignment also employs this technique, and this method is called stochastic if the immediate payoffs and the next state are known onyl as probabilities. An example of this method is modifying a recursive program to calculate the Fibonacci sequence so that the program stores each value of the sequence after calculating it and then reuses it if it is needed again instead of recalculating. For 10 points, name this method of problem solving, which aims to efficiently solve optimization problems which have overlapping sub-problems, and is often used to solve the traveling salesman problem and to check edit distance in spellcheckers.
A Bellman equation is an condition associated with this technique, which is employed by the Cocke-Younger-Kasami algorithm that asks whether a string can be generated by a given context-free grammar.
dynamic programming