Dynamic programming is maybe the most important use of computer science in biology, but certainly not the only one.
动态编程可能是计算机科学在生物学上最重要的应用，但肯定不是唯一的应用。
Introduces a dynamic programming model for both server and client.
为客户机和服务器引入了一个动态编程模型。
Dynamic programming is an algorithmic technique used commonly in sequence analysis.
动态编程是在序列分析中经常使用的一种算法技术。
Dynamic programming is used when recursion could be used but would be inefficient because it would repeatedly solve the same subproblems.
在可以使用递归，但因为递归重复解决相同的子问题造成效率低下的时候，则可以采用动态编程。
This is exactly how dynamic programming works.
这就是动态编程的工作原理。
Other dynamic programming languages would use similar descriptions of the data structure.
其它动态编程语言可以使用类似的数据结构描述。
But dynamic programming is usually applied to optimization problems like the rest of this article's examples, rather than to problems like the Fibonacci problem.
但是动态编程通常被用于最优化问题(比如本文后面的示例)，而不是像斐波纳契数这样的问题。
To compute the LCS efficiently using dynamic programming, you start by constructing a table in which you build up partial results.
为了用动态编程有效地计算lcs，首先需要构建一个表格，用它保存部分结果。
That's a huge improvement. And that's sort of the magic of dynamic programming.
这是一个很大的进步，这也是动态编程的魅力所在。
You'll first see how to use dynamic programming to find a longest common subsequence (LCS) of two DNA sequences.
首先将要看到如何运用动态编程查找两个DNA序列的最长公共子序列（longest commonsubsequence，LCS）。
Blue is a dynamic programming language with unique features.
Blue是一种具有独特功能的动态编程语言。
Commenting on a recent debate on Static vs. dynamic Typing, Palermo noted that dynamic programming is hard when it comes to use libraries because.
静态vs .动态类型的讨论的评论中，Palermo提出当直接使用外部函数库的时候，动态编程就非常困难，原因是。
This article has looked at three examples of problems that can be solved using dynamic programming. They all share these characteristics
本文介绍了使用动态编程能够解决的三个问题示例。
Protocols are a new feature introduced in version 1.2 of Clojure, a dynamic programming language for the JVM.
协议是Clojure 1.2版-即jvm的动态编程语言-引入的新功能。
Dynamic programming is also used in matrix-chain multiplication, assembly-line scheduling, and computer chess programs.
动态编程还可用于矩阵链相乘、装配线规划和计算机象棋程序。
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.
为了更好地理解动态编程算法，可以画一个表格，它的行对应源单词的字母，它的列对应目标单词的字母。
Dynamic programming model: JAX-WS's dynamic client model is quite different from the JAX-RPC mode.
动态编程模型：JAX - WS的动态客户端模式与JAX - RPC模式差别很大。
This is about 01 knapsack problem dynamic programming algorithm.
这是关于01背包问题的动态规划算法。
Dynamic programming and its appliance have been elaborated in this article.
本文详细的阐述了动态规划及其应用的一些重要问题。
Check out Wikipedia to learn about Multi-paradigm programming languages, object-oriented programming, and dynamic programming languages.
查看Wikipedia以了解多范型编程语言、面向对象编程以及动态编程语言。
The algorithm is of the isochronic and discrete dynamic programming.
该算法是一种等时性离散动态规划法。
Finally the static schedule in each virtual manufacturing cell is generated with discrete dynamic programming.
最后，通过离散动态规划形成虚拟制造单元的生产作业调度次优可行方案。
The degree of difficulty in algorithms is gradually enhanced in proper order from dynamic programming to continue fraction algorithm.
算法的实现难易程度由动态规划算法到多项式算法依次提高。
Note however, there is a pseudo-polynomial dynamic programming solution to subset sum that might be utilized here as well.
然而，有一个伪多项式时间的动态规划的解决方案的子集这可能被利用在这里就好了。
Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
Solving a dynamic programming problem of a central planner can prove that the competitive equilibrium and the social optimum is identical.
随后又从中央计划者角度求解一个动态最优化问题，发现社会最优和竞争性均衡是一致的。
The problem can be solved by using dynamic programming state-space relaxation.
该问题清晰化后可利用动态规划状态空间松弛来求解。
The problem can be solved by using dynamic programming state-space relaxation.
该问题清晰化后可利用动态规划状态空间松弛来求解。
应用推荐