Category:Dynamic programming
![]() | Computing portal |
Here is a list of articles in the Dynamic programming category of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "Dynamic programming"
The following 48 pages are in this category, out of 48 total.
- Dynamic programming (computing)
A
- Approximate string matching (computing)
- Automatic basis function construction (computing)
B
- Backward induction (computing)
- Bellman equation (computing)
- Bellman–Ford algorithm (computing)
- Bitonic tour (computing)
C
- Curse of dimensionality (computing)
D
- Damerau–Levenshtein distance (computing)
- Differential dynamic programming (computing)
- Dynamic discrete choice (computing)
- Dynamic time warping (computing)
E
- Earley parser (computing)
F
- Floyd–Warshall algorithm (computing)
- Forward–backward algorithm (computing)
H
- Hamilton–Jacobi–Bellman equation (computing)
- Held–Karp algorithm (computing)
- Hirschberg's algorithm (computing)
- Hunt–McIlroy algorithm (computing)
- Hunt–Szymanski algorithm (computing)
K
- Knapsack problem (computing)
L
- Levenshtein distance (computing)
- Line wrap and word wrap (computing)
- Longest alternating subsequence (computing)
- Longest common subsequence problem (computing)
- Longest common substring problem (computing)
- Longest increasing subsequence (computing)
M
- Markov decision process (computing)
- Matrix chain multiplication (computing)
- Maximum subarray problem (computing)
- Most frequent k characters (computing)
N
- Needleman–Wunsch algorithm (computing)
O
- Optimal stopping (computing)
- Optimal substructure (computing)
- Overlapping subproblems (computing)
P
- Partially observable Markov decision process (computing)
- Pika parser (computing)
Q
- Quadratic knapsack problem (computing)
R
- Recursive economics (computing)
- Ruzzo–Tompa algorithm (computing)
S
- Shortest common supersequence problem (computing)
- Smith–Waterman algorithm (computing)
- Stochastic dynamic programming (computing)
- Subset sum problem (computing)
V
- Value function (computing)
- Viscosity solution (computing)
- Viterbi algorithm (computing)
W
- WASP (cricket calculation tool) (computing)