programming algorithmの例文
もっと例文: 1 2 3 4 5 6 7 8 9
- Specifically, it encodes portions of the input using the result of a dynamic programming algorithm, where the subproblems are finding the approximately optimal encoding ( the one with minimal post-range-encoding size ) of the substring of length L starting at the byte being compressed.
- The footprints of Landau's research can be found in almost every subarea of string algorithms, including his foundational work on dynamic programming algorithms for the edit distance problem, his numerous papers on modeling digitized images and 2D matching, incremental sequence alignment, and recently, his work on jumbled pattern matching and compressed text algorithms.
- For example, in the coin change problem of finding the minimum number of coins of given denominations needed to make a given amount, a dynamic programming algorithm would find an optimal solution for each amount by first finding an optimal solution for each smaller amount and then using these solutions to construct an optimal solution for the larger amount.
- Although NP-hard, the minimum weight triangulation may be constructed in subexponential time by a dynamic programming algorithm that considers all possible simple cycle separators of O ( \ sqrt n ) points within the triangulation, recursively finds the optimal triangulation on each side of the cycle, and chooses the cycle separator leading to the smallest total weight.
- For example, the NP-hard knapsack problem can be solved by a dynamic programming algorithm requiring a number of steps polynomial in the size of the knapsack and the number of items ( assuming that all data are scaled to be integers ); however, the runtime of this algorithm is exponential time since the input sizes of the objects and knapsack are logarithmic in their magnitudes.
