This is about 01 knapsack problem dynamic programming algorithm.
这是关于01背包问题的动态规划算法。
Improved on the traditional tree matching with dynamic programming algorithm.
改进了传统的树匹配和动态规划算法。
In this paper, a new dynamic programming algorithm for unconstrained 2D stuck cutting problem is presented.
本文给出了一种求解无限制板材下料问题的动态规划解法，对该算法的计算复杂度进行了分析。
The planning track that is gotten from dynamic programming algorithm sometimes can not achieve the aimed target.
通常所使用的动态规划算法得到的规划航迹有时达不到目标点。
A forward dynamic programming algorithm is presented in allusion to features of the moving infrared small dim target.
文章针对低信噪比下红外弱小运动目标的特点，提出了一种正向动态规划算法。
GTSP is changed into multi-segment map problem which is solved with dynamic programming algorithm by individual coding.
通过个体编码方法，将GTSP转化为多段图最短路径问题，采用动态规划算法求解；
It is easily shown that this problem is NP-hard, and a dynamic programming algorithm and a branch-and-bound algorithm are developed to solve it optimally.
文中简单说明此问题为NP -难问题，并提出了一种动态规划算法和一种分枝定界算法来求得此问题的最优解。
A dynamic programming algorithm based on the global optimization is presented to extract the maximum frequency waveform of the Doppler ultrasound blood flow signal.
提出一种基于全局优化的动态规划算法以进行超声多普勒血流信号最大频率曲线的提取。
In this paper an improved dynamic programming method to determine unit commitment is proposed. This proposed method is also named interpolated dynamic programming algorithm.
提出了一种确定机组组合的改进动态规划方法，称为插值动态规划算法。
The Dynamic Programming algorithm is best understood by drawing a grid whose rows correspond to the letters of the source, and whose columns correspond to the letters of the target.
为了更好地理解动态编程算法，可以画一个表格，它的行对应源单词的字母，它的列对应目标单词的字母。
The algorithm is of the isochronic and discrete dynamic programming.
该算法是一种等时性离散动态规划法。
The degree of difficulty in algorithms is gradually enhanced in proper order from dynamic programming to continue fraction algorithm.
算法的实现难易程度由动态规划算法到多项式算法依次提高。
In this algorithm, dynamic programming is used to calculate optimal local cosine tree during the LCT for signals, and the optimal entropy code is gained by the best partition of time axes.
算法对信号进行局部余弦变换时采用动态规划算法计算最佳局部余弦树，通过获得信号在时间轴上的最佳划分来获得信号的最优嫡编码。
Based on it, the mathematical model and algorithm of feature matching via Dynamic Programming are established.
基于这些特征描述建立了用动态规划法进行特征匹配的数学模型和算法。
A linear scaling(LS) based dynamic programming(DP) algorithm was developed for accurate matching of queries by humming.
提出一种用于哼唱识别精确匹配的线性伸缩动态规划算法。
In order to get precise and dense disparity maps, a stereo matching algorithm using adaptive cost aggregation and dynamic programming is proposed.
为了得到准确、稠密的视差图，提出了一种利用自适应能量聚集和动态规划的立体匹配算法。
A ground control point based stereo matching algorithm via iterative dynamic programming is proposed.
提出一种基于地面控制点的迭代动态规划立体匹配算法。
Bounded search tree and dynamic programming are frequently-used techniques in parameterized algorithm.
在典型的参数算法中，有界搜索树和动态规划是常用技术。
A stereo matching algorithm based on control points is proposed for layered and bidirectional dynamic programming.
提出一种基于控制点的分层双向动态规划立体匹配算法。
Using this method, this article chooses a relatively better control algorithm named restricted dynamic programming (RDP) for this system.
运用此方法，给出了一种适用于中药智能配药系统的控制优化算法——有限动态规划法。
Sequence alignment algorithm is an important research direction in Bioinfor-matics. Dynamic programming is the most efficient and basic method in sequence alignment algorithm.
序列比对算法是生物信息学中重要的研究方向之一，而动态规划法是序列比对算法中最有效最基本的方法。
The paper also proposes a solution of dynamic ATC based on interior point nonlinear programming algorithm.
同时提出了求解动态ATC问题的内点非线性规划算法。
Then a new algorithm based on dynamic programming is proposed through improving the step-length. Finally, the complexity of the algorithm is analyzed.
然后结合动态规划的基本原理，改进了算法的步长，从而得到了求解该问题的优化的动态规划算法。
On uncertain network, through the construction of distribution network, we have proposed Shortest Path Search algorithm Based on the thinking of dynamic programming.
在网络不确定情况下，通过对配送网络的构建，提出了基于动态规划思想的最短路径搜索算法。
To the problems of dynamic programming stereo matching algorithm modified by ground control points (GCPs), a pyramid two-level dynamic programming stereo matching algorithm is proposed.
针对控制点修正的动态规划立体匹配算法存在控制点求取时间长、实时性差的问题，提出一种金字塔双层动态规划立体匹配算法。
Using prefix tree and dynamic programming, this algorithm boosts the speed of Chinese word segmentation and guarantees relatively high precision.
基于前缀树和动态规划，该算法提高了中文分词速度，同时保持了相对较高的分词准确性。
When to switch from Dynamic Programming (2D table) to Branch & Bound algorithm?
当切换动态规划（二维表）的分支定界算法？
Global chaining algorithm recovers disconnected fragments of whole objects using dynamic programming method, and obtains good performance in curvilinear detection from strong noise.
线段全局链算法利用动态规划方法来恢复全局物体中的不连续片断，在强噪声中的曲线检测方面获得了较好的效果。
Global chaining algorithm recovers disconnected fragments of whole objects using dynamic programming method, and obtains good performance in curvilinear detection from strong noise.
线段全局链算法利用动态规划方法来恢复全局物体中的不连续片断，在强噪声中的曲线检测方面获得了较好的效果。
应用推荐