在编程模型上支持普通的主—从模式的编程模式和具有子任务递归迭代的分治模式编程。
Besides the master-slave style parallel programming model and the divide-conquer style were also supported on GCRSE.
本文提出了一种直接识别系统参数的闭形式表达式，避免了参数递归迭代方法的误差传播问题。
In this paper we proposed a closed form solution for direct identification of FIR system parameter, which circumvents the problem of error propagation.
在实证研究中，以PLS—结构方程原理为支撑，采用递归迭代方法对应用模型进行了详尽的拟合分析与统计检验。
In the demonstration research, base on the PLS - structure equation principle, used the recursion iteration method to carry on the exhaustive fitting analysis and the statistical test using the model.
还应该熟悉一般的编程技术，如迭代和递归。
You should also be familiar with general programming techniques such as iteration and recursion.
如果说迭代是逐个解决一大堆步骤的话，递归就是把所有步骤堆起来一次性解决。
If iteration is a bunch of steps leading to a solution, recursion is like piling all of those steps on top of each other and then quashing them all into the solution.
这种遍历非常有趣，因为它是迭代的，而不是递归的，这是zippers 遍历与之前的 clojure.walk实现之间的主要差别。
This traversal is interesting because it is iterative, not recursive, which is a key difference between zipper traversal and the prior clojure.walk implementation.
Lisp提供用于迭代的编码结构，但递归是更受欢迎的列表遍历方式。
Lisp provides coding structures for iteration, but recursion is a far more popular way to navigate lists.
在前面两个例子里,每一部问题的规模缩小了,不管是迭代的还是递归的，这表明这个问题的复杂性可能是线性的。
In the first two cases, the problem reduced by 1 at each step.
第二部分代表迭代或递归。
请注意这是典型的功能性编程，取决于迭代上的递归。
Note that this is classical functional programming, relying on recursion over iteration.
有趣的是要注意递归与迭代在命令性语言中同样高效，因为递归在幕后被转化成迭代。
It's interesting to note that recursion is as efficient as iteration in imperative languages because the recursion is translated into iteration under the covers.
由于尾部递归优化，这种方式是对列表进行迭代的一种非常简单的方式。
With tail-recursion optimization, this idiom is a marvelously concise way to iterate over a list.
实际上一旦你听到了大致描述，就能很轻松的写出代码来，在这一点上应用递归来解决问题，比用迭代要容易理解多了。
Once you hear that description, it's easy to write the code, in fact. This is a place where the recursive version of it is much easier to think about than the iterative one.
迭代固定的次数是XSLT 1.0中可能需要使用递归模板的另一种形式。
Iterating a fixed number of times is another way you might have needed to use recursive templates with XSLT 1.0.
我们稍后会去，看它的变量，它的所谓的递归数的变量，但是现在我得先讲讲，怎么来实现迭代。
We're going to see variations of this, we're going to see a variation of it called recursion, a little later on, but for now we're just going to talk about how do we do iterations.
第 5章介绍了划分问题、递归函数到迭代函数的转换（我可以向您保证，这非常有趣）以及阶乘和斐波纳级数的实现。
Chapter 5 deals with partitioning problems, converting recursive functions to iterative functions (it's fun, I assure you), and more factorial and Fibonacci series implementations.
这个递归函数能很好地工作，不过它有一个主要的缺点 ——递归的每一次迭代都要为the-string传递相同的值。
This recursive function works fine, but it has one main shortcoming -- every iteration of the recursion will be passing the same value for the-string.
Lisp编译器或解释器能够将特定形式的递归翻译为迭代，从而允许以一种更为简单明快的方式来使用递归数据结构（如树结构）。
The Lisp compiler or interpreter can translate certain forms of recursion to iteration, allowing a simpler, cleaner way to work with recursive data structures, such as trees.
注意，在循环的结尾处，我用一个比上次大1的参数递归地调用同一个函数，以实现循环的迭代。
Note at the end of the loop that I recursively call the same function with an argument that is one greater than the previous, implementing the iteration of the loop.
任何可以用递归实现的算法都可以用迭代实现。
Any algorithm that can be implemented using recursion can also be implemented using iteration.
递归是比迭代循环更有力的算法。
迭代的是人，递归的是神。
迭代的是人，递归的是神。
应用推荐