改进了传统的树匹配和动态规划算法。
Improved on the traditional tree matching with dynamic programming algorithm.
这是关于01背包问题的动态规划算法。
This is about 01 knapsack problem dynamic programming algorithm.
在导航系统中，全局路径规划采用改进动态规划算法。
So it's real good path planning method for the multiple robots system.
建立了求解最优控制问题的连续微分动态规划算法步骤。
The steps of continuous differential dynamic programming were established for this optimal control problem.
提出一种用于哼唱识别精确匹配的线性伸缩动态规划算法。
A linear scaling(LS) based dynamic programming(DP) algorithm was developed for accurate matching of queries by humming.
并给出了有限时域上寻优的动态规划算法的充分必要条件。
The sufficient and necessary conditions of the dynamic programming algorithms which can search to optimization during limited time period are also given.
算法的实现难易程度由动态规划算法到多项式算法依次提高。
The degree of difficulty in algorithms is gradually enhanced in proper order from dynamic programming to continue fraction algorithm.
通常所使用的动态规划算法得到的规划航迹有时达不到目标点。
The planning track that is gotten from dynamic programming algorithm sometimes can not achieve the aimed target.
在传统的动态规划法基础上，提出了一种局部加密动态规划算法。
Based on the traditional dynamic programming method, this paper proposes a local redefined dynamic programming method for power market.
在实际应用中，动态规划算法的空间复杂度是限制问题规模的瓶颈。
In practical application, the spacial complexity of algorithm is the bottleneck of problem's scale.
最后利用动态规划算法计算已知层序列和被分割序列的最佳匹配距离。
And lastly the optimum matching distances between the sequence of known beds and the resulting sequence are calculated by dynamic programming.
提出了一种确定机组组合的改进动态规划方法，称为插值动态规划算法。
In this paper an improved dynamic programming method to determine unit commitment is proposed. This proposed method is also named interpolated dynamic programming algorithm.
文章针对低信噪比下红外弱小运动目标的特点，提出了一种正向动态规划算法。
A forward dynamic programming algorithm is presented in allusion to features of the moving infrared small dim target.
通过个体编码方法，将GTSP转化为多段图最短路径问题，采用动态规划算法求解；
GTSP is changed into multi-segment map problem which is solved with dynamic programming algorithm by individual coding.
提出一种基于全局优化的动态规划算法以进行超声多普勒血流信号最大频率曲线的提取。
A dynamic programming algorithm based on the global optimization is presented to extract the maximum frequency waveform of the Doppler ultrasound blood flow signal.
然后结合动态规划的基本原理，改进了算法的步长，从而得到了求解该问题的优化的动态规划算法。
Then a new algorithm based on dynamic programming is proposed through improving the step-length. Finally, the complexity of the algorithm is analyzed.
对于不可等待的情况证明了它是强NP-难的，并给出了动态规划算法和一个最坏情况界为5/3的近似算法。
For no-waited model, we show it is strongly NP-hard, and present a pseudo-polynomial time optimal algorithm and an approximation algorithm with worst-case ratio 5/3.
文中简单说明此问题为NP -难问题，并提出了一种动态规划算法和一种分枝定界算法来求得此问题的最优解。
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.
实验结果表明，新算法比传统的动态规划算法在遮挡检测和匹配精度上都有一定的提高，算法可靠性强，运算量小。
Experimental results show that the new algorithm has certain enhancement in the precision of occlusion detection and matching, and is more reliable and faster than conventional dynamic algorithms.
算法对信号进行局部余弦变换时采用动态规划算法计算最佳局部余弦树，通过获得信号在时间轴上的最佳划分来获得信号的最优嫡编码。
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.
通过假设网格环境和设置相应变量，基于博弈理论建立了网格资源分配机制和竞价策略博弈模型，并应用动态规划算法证明了纳什均衡的存在。
From assuming the grid environment and set variables, the thesis founded a grid resource allocate mechanism and a biding policy model, proved the existent of Nash Equilibrium.
通过假设网格环境和设置相应变量，基于博弈理论建立了网格资源分配机制和竞价策略博弈模型，并应用动态规划算法证明了纳什均衡的存在。
From assuming the grid environment and set variables, the thesis founded a grid resource allocate mechanism and a biding policy model, proved the existent of Nash Equilibrium.
应用推荐