Dynamic programming
Problem optimization method
Follow Dynamic programming on Notably News to receive short updates to your email — rarely!
We include updates on Levenshtein distance, Knapsack problem, Markov decision process, Bellman–Ford algorithm, Curse of dimensionality, Floyd–Warshall algorithm, Bellman equation, Subset sum problem, Viterbi algorithm, Maximum subarray problem, Approximate string matching, Needleman–Wunsch algorithm, Hamilton–Jacobi–Bellman equation, Damerau–Levenshtein distance, Optimal stopping, Smith–Waterman algorithm ... and more.
| 2024 |
Longest common subsequence
Brodal, Fagerberg, and Moldrup Rysgaard formally proved the correctness of computing the longest palindromic subsequence by finding the longest common subsequence between a string and its reversal, a method previously considered folklore for decades.
|
| 2018 |
WASP
NV Play partners with Dr Scott Brooker to extend the WASP tool, incorporating a concept of pressure and developing enhanced player contribution metrics.
|
| 2018 |
WASP
NV Play, a global cricket technology company, acquires ownership of the underlying WASP system.
|
| November 2012 |
WASP
WASP is first publicly introduced by Sky Sport New Zealand during a Twenty20 cricket match between Auckland and Wellington in the HRV Cup.
|
This contents of the box above is based on material from the Wikipedia articles Viterbi algorithm, Longest common subsequence, Needleman–Wunsch algorithm & WASP (cricket calculation tool), which are released under the Creative Commons Attribution-ShareAlike 4.0 International License.