programming algorithm 예문

예문

예문 더보기:   1  2  3  4  5  6  7  8  9

1. In 1971, Knuth published a relatively straightforward dynamic programming algorithm capable of constructing the statically optimal tree in only O ( n 2 ) time.
2. Since the dual maximization problem is a quadratic function of the c _ i subject to linear constraints, it is efficiently solvable by quadratic programming algorithms.
3. As with a sequence profile, the structural profile is moved along a target sequence to find the highest possible alignment score by a dynamic programming algorithm.
4. At an iterate x _ k, a basic sequential quadratic programming algorithm defines an appropriate search direction d _ k as a solution to the quadratic programming subproblem
5. If " P " ( the number of place values ) is a small fixed number, then there are dynamic programming algorithms that can solve it exactly.