dp greedy algorithm dp贪婪算法
A B-spline deformed active contour model based on DP algorithm is presented.
提出了一种基于动态规划法的B样条可变形活动轮廓模型。
参考来源 - 基于活动轮廓模型的图像特征提取方法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
The computational experiments show that the proposed DP algorithm can handle problems up to at least 25 jobs.
结果表明，所提出算法至少可以求解25个工件规模的越库配送排序问题。
With Massive complex computations, DP algorithm can obtain optimized alignment result, but it may neglect the biological significance in sequences.
虽然DP算法通过复杂的数学计算可以获得最优或近似最优的精确比对结果，但有可能忽略掉序列本身的生物意义。
B-spline is the most popular method to present free-form curve and surface, and DP algorithm is the effective approach for solving discrete optimization problems.
样条方法是当前自由曲线曲面造型最为常用的方法，动态规划为解决离散最优化问题的有效手段。
应用推荐