dynamic programming algorithm发音

意思翻译

动态规划算法

相似词语短语

dynamic programming───动态规划，动态规划法；动态规划；动态程序设计

algorithm───n.算法，运算法则

asystole algorithm───心脏停搏算法

programming language───n.程序设计语言；[计]编程语言；[计]程序设计语言

supervised algorithm───有监督算法

dynamic pricing───动态定价

algorism algorithm───算法

dynamic poses───动态姿势

continuations programming───连续程序设计

双语使用场景

The planning track that is gotten from dynamic programming algorithm sometimes can not achieve the aimed target.───通常所使用的动态规划算法得到的规划航迹有时达不到目标点。

Improved on the traditional tree matching with dynamic programming algorithm.───改进了传统的树匹配和动态规划算法。

This is about 01 knapsack problem dynamic programming algorithm.───这是关于01背包问题的动态规划算法。

The Optimal Control Model and its Dynamic Programming Algorithm of the Size of One- Type of the Employees in the Employee Leasing Center P .───人才租赁中介中心单类雇员最优控制模型及其动态规划算法。

It proves that the bi-level model and its dynamic programming algorithm can support the decision of transportation network design.───计算的结果表明，问题的双层规划模型和动态规划求解算法能够为路网规划决策提供支持。

Middle-term and long-term optimization model take all state increment dynamic programming algorithm as the optimization algorithm.───中长期优化模型均使用增量动态规划算法作为优化算法。

Absrtact: The dynamic programming algorithm is a flexible and high - efficient method to many problems which have the best method.───摘要：动态规划设计策略对许多具有最优解的实际应用问题的解决是灵活和有效的。

In this paper, a new dynamic programming algorithm for unconstrained 2D stock cutting problem is presented.───本文给出了一种求解无限制板材下料问题的动态规划解法，对该算法的计算复杂度进行了分析。

GTSP is changed into multi-segment map problem which is solved with dynamic programming algorithm by individual coding.───通过个体编码方法，将GTSP转化为多段图最短路径问题，采用动态规划算法求解；

英语使用场景

This is about 01 knapsack problem dynamic programming algorithm.

Dynamic programming algorithm matlab source, m file, from the toolbox call.

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.

In this paper, a new dynamic programming algorithm for unconstrained 2 D stock cutting problem is presented.

Then dynamic programming algorithm is used to accomplish the alignment processing.

Based on the principle of optimality, a dynamic programming algorithm of minimal transfer times for a viable route was designed and this could be used to determine the upper bound.

By applying the dynamic programming algorithm and combing the practice, this article sets up mathematical model to optimize the reservoir operation chart.