如果迭代次数为零，就表示从不执行该语句。
If the number of iterations is zero, it means the statement was never executed. If however the number of iterations field is empty it means one of four things.
减少循环的迭代次数可获得显著的性能提升。
Decreasing the number of iterations throughout the loop can therefore lead to greater performance gains.
实验结果表明，该方法明显减少了迭代次数。
The experimental results show that this method can greatly reduce the iterations.
物理计算中的内外迭代次数也显著地减少了。
The number of inner and outer iterations in the physics calculation is also apparently reduced.
该方法既可提高编码效率，又可减少解码迭代次数。
It can improve the coding efficiency while reduce the decoding iteration steps.
最广为人知的限制循环迭代次数的模式称作“达夫设备”。
The most well known approach to limiting loop iterations is a pattern called Duff's Device.
大学用了几年的时间已经对几项可穿电脑的迭代次数做了笨拙的修补。
The university has tinkered with several iterations of wearable computers over the years.
计算实例表明该方法具有迭代次数较少，收敛较快的特点。
Calculation examples show that the advantages of this method are saving in iterative time and increasing rapidly in convergence.
while循环很少包含迭代次数——除非它是一个伪装的for循环。
A while loop will rarely include the number of iterations — unless it is a for loop in disguise.
团队经历的迭代次数与需要实现阶段的目标的数量是一样的，而不是更多。
Teams go through as many iterations as they need to address the objectives of that phase, but no more.
该算法具有简单、易行、迭代次数少，而且易于理解的特点。
This algorithm has the advantages of simplicity, feasibility, low computation cost and easy understanding.
该算法具有收敛速度快、迭代次数少且不易陷入不成熟收敛等优点。
This algorithm has the advantages of fast convergence speed, small number of convergence and easy to get premature convergence.
该算法具有收敛速度快、迭代次数少且不易陷入不成熟收敛等特点。
This algorithm has the advantages of fast convergence speed, small mumber of convergence and not easy to get premature convergence.
结果表明改进后的BP算法减少了迭代次数，提高了寻优的收敛速度。
The MATLAB simulation shows the improved weighted algorithm is of more efficien than conventional BP algorithm.
该策略通过不同迭代次数中种群相似度的差值实现两种算法的动态融合。
The dynamic combination of GA and ACO in the strategy is realized by the difference of population similarity in different iterations.
改善循环性能的最好办法是减少每次迭代中的运算量，并减少循环迭代次数。
The best ways to improve loop performance are to decrease the amount of work done per iteration and decrease the number of loop iterations.
这个称为时间效率的场景可以减少业务与IT之间的迭代次数，从而使流程更快速地完成。
This scenario, called time to value, can reduce the number of iterations between the business and it, bringing the process to completion more rapidly.
新循环代码每次迭代中减少两个操作，随着迭代次数的增长，性能将显著提升。
The new loop code has two fewer operations per iteration, which can lead to increasing performance gains as the number of iterations increases.
基于模糊模型，关联平衡算法能找到使目标函数更小的解，并且迭代次数更少。
Based on fuzzy model, the interaction balance method can find better solution with fewer iterations.
试验表明，这些算法能够降低退化带来的不良影响，减少总迭代次数和运算时间。
Tests showed that these algorithms reduce advent effects of degeneracy, and low total number of iterations and running time.
本文提出了一种同时进行乘法和除法而不增加迭代次数的复合算法(乘除算法)。
Presented in this paper is a mixed algorithm (MD algorithm), which carries out multiplication and division at the same time without increasing the number of recursive operation.
计算和实验结果表明，阴极边界调整法收敛性较好，迭代次数适当，能满足设计要求。
The calculations and the experiments show that the convergence property and the iteration time of the method are excellent, and the method is available in the ECM.
与后者相比，这种算法所需迭代次数可减少一倍，因而运算速度可以得到较多的提高。
In comparison with the conventional algorithm, the calculating speed of our algorithm can be doubled.
数值计算表明，这种方法可以降低方程的迭代次数约40%，并明显减少方程的求解时间。
Numerical results present that this method can decrease the number of iterative by 40% and reduce the computation time greatly.
数值计算表明，这种方法可以降低方程的迭代次数约35%，并明显减少方程的求解时间。
Numerical results present that this method can decrease the iterative number by 35% and reduce the computation time greatly.
随着迭代次数的增加，迭代区间将逐步减小，直至逼近真值，由此即可构造定界迭代算法。
Along with the increasing of iteration times, iterative range will gradually dwindle until approach to true value, and demarcation iterative algorithm can be constructed.
在调整视电阻率的公式中加入一个迭代系数，可使计算值快速趋向于观测值，减少了迭代次数；
If a iterative coefficient is added to the formula used to adjust apparent resistivity, the calculated value will rapidly access to observation value, therefore the number of iteration is lowered.
在默认情况下，任何循环在达到一定的迭代次数(比如10,000次)之后，就应该触发整个方法的编译。
By default, any loop should trigger compilation of the entire method after 10,000 iterations or so.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.
因为大多数for循环处理的复杂逻辑不允许静态地确定迭代次数，因此您不会经常使用这种格式的括号表示。
Because most for loops deal with complicated logic that does not allow the number of iterations to be statically determined, you will not often employ this form of bracket notation.
应用推荐