dynamic programming algorithm的意思

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.