What is the translation of " DYNAMIC PROGRAMMING " in Chinese?

• 动态规划
• 动态编程

Examples of using Dynamic programming in English and their translations into Chinese

Second approach uses dynamic programming.
第二种是动态规划的方法。

Dynamic programming can only be applied to problems with optimal substructure.
动态规划只能应用于有最优子结构的问题。

This problem is a dynamic programming(DP) problem.
可以看出这其实是一个动态规划（DP）问题。

Dynamic programming allows us to build the PP in my pajamas just once.
动态规划使我们能够只建立一次PPinmypajamas。

We will also explore some simple and effective dynamic programming solutions.
我们还将探索一些简单而有效的动态规划解决方案。

Majority of the Dynamic Programming problems can be categorized into two types:.
大多数动态规划问题都能被归类成两种类型：.

On some architectures, the code below can also be optimized by dynamic programming.
在部分架构中，下以程式码也可由动态规划进行最佳化。

Function virahanka2() implements a dynamic programming approach to the problem.
函数virahanka2()实现动态规划方法解决这个问题。

Exponential time E 2O(n) 1.1n, 10n Solving the traveling salesman problem using dynamic programming.
指数时间E2O(n)1.1n,10n使用动态规划解决旅行推销员问题.

Not too many people use dynamic programming, but it would be nice to change the language.
并非太多人使用动态编程，但是这将很好的改变语言。

For example, I implemented a physics engine but never solved a dynamic programming problem.
比如，我实现了一个物理引擎，但从未解决过动态规划的问题。

Dynamic programming, on the other hand, is an approach for solving problems with overlapping'sub-problems.".
另一方面，动态编程是解决“子问题”重叠的问题的一种方法。

For small values of n, the optimal r can also be obtained by standard dynamic programming methods.
对于较小的n值，最优的r也可以通过动态规划方法得到。

Unlike A*, IDA* does not utilize dynamic programming and therefore often ends up exploring the same nodes many times.
与A*不同，IDA*不使用动态编程，因此经常会多次访问相同的节点。

(with linear exponent) E 2O(n) 1.1n, 10n Solving the traveling salesman problem using dynamic programming.
指数时间E2O(n)1.1n,10n使用动态规划解决旅行推销员问题.

Dynamic Programming solutions are faster than exponential brute method and can be easily proved for their correctness.
动态编程解决方案比指数暴力方法更快，并且可以很容易地证明它们的正确性。

Given that restriction, it is possible to use dynamic programming(4.7) to efficiently find the most likely tag sequence.
由于这种限制，它可以使用动态规划（4.7节），有效地找出最有可能的标记序列。

In dynamic programming, computed solutions to subproblems are stored in a table so that these don't have to be recomputed.
在动态规划中，子问题解决方案被存储在一个表中，以便这些不必重新计算。

This domain includes challenges on sorting data, dynamic programming, and searching for keywords and other logic-based tasks.
这个领域包括数据排序，动态编程，搜索关键字和其他基于逻辑的任务方面的挑战。

Dynamic Programming- self-modifying programs, eval magic, special types of eval, adding variables and methods, and more.
动态编程-自修改程序、重运算魔法、特殊类型的运算、添加变量和方法以及更多.

Other technologies invented at USC include DNA computing, dynamic programming, image compression, VoIP, and antivirus software.
USC发明的其他技术包括DNA计算，动态编程，图像压缩，VoIP和防病毒软件。

By employing adaptive dynamic programming(ADP) technique, optimal controllers are obtained without relying on the knowledge of system dynamics.
通过采用自适应动态规划（ADP）技术，获得最优控制器而不依赖于系统动力学的知识。

Chapter 3~5 describe three fundamental classes of methods for solving finite Markov decision problems: dynamic programming, Monte Carlo methods, and temporal-difference learning.
接下来的三章描述了解决有限马尔可夫决策问题的三种基本方法：动态规划，蒙特卡洛方法和时间差异学习。

Introduction Ruby is a dynamic programming language you can use to write anything from simple scripts to games and web applications.
Ruby是一种动态编程语言，可以用于从简单的脚本到游戏和Web应用程序。

LLVM has unified the compilation strategies for static, bytecode, and dynamic programming languages, enabling a wide range of research and commercial uses.
LLVM已统一为静态的，字节码和动态编程语言编译策略，实现了广泛的研究和商业用途。

JavaScript is also a dynamic programming language which means that properties can be easily added or removed from an object after its instantiation.
JavaScript也是一种动态编程语言，这意味着可以在实例化后轻松地在对象中添加或删除属性。

Python, like PHP is a server side and non-compiled dynamic programming language that can be used on its own or as part of another framework.
Python和PHP一样是服务器端和非编译动态编程语言，它可以单独使用，也可以作为另一个框架的一部分使用。

Dynamic programming is an algorithm design technique used widely in NLP that stores the results of previous computations in order to avoid unnecessary recomputation.
动态规划是一种在NLP中广泛使用的算法设计技术，它存储以前的计算结果，以避免不必要的重复计算。

Techniques from reinforcement learning, dynamic programming and modern nonlinear control are used to obtain a new class of learning-based adaptive optimal controllers.
报告从增强学习，动态规划与现代非线性控制等技术出发，设计基于数据学习的自适应最优控制器。

In terms of mathematical optimization, dynamic programming usually refers to simplifying a decision by breaking it down into a sequence of decision steps over time.
就数学优化（mathematicaloptimization）而言，动态规划通常是指通过将决策分解为一系列子决策步骤来简化决策。