分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
通过与并行寻优、线性组合方法的比较，得出了分级优化法具有灵活性及收敛性好等特点的结论。
The conclusion is that, compared with the parallel-searching and the linear combination methods, the sectional optimization method is more flexible and better in convergence.
最后基于该方法计算的应力场，应用并行组合模拟退火算法搜索坝基最危险滑动模式及相应的最小安全系数。
Finally, based on the stress fields of FEM analysis, the most dangerous sliding mode and the minimum anti-sliding factor are searched by parallel recombination simulated annealing algorithm.
本论文提出一快速的组合电路错误模拟器，此错误模拟器结合了并行错误模拟与临界路径追纵方法的优点。
A new combinational fault simulator, PARCRIPT, which combines the merits of the concept of the parallel fault simulation and the efficiency of the critical path tracing (CRIPT), is presented.
④组合扩展优先矩阵。由此，建立了与动态CAD设计交叉并行、逐步完善的工艺优先关系描述方法。
Thus, a method with intercrossed concurrent and increasingly iterative perfection for the description of precedence relation in the dynamic CAD design has been worked out.
④组合扩展优先矩阵。由此，建立了与动态CAD设计交叉并行、逐步完善的工艺优先关系描述方法。
Thus, a method with intercrossed concurrent and increasingly iterative perfection for the description of precedence relation in the dynamic CAD design has been worked out.
应用推荐