1) parallel partition and recursion
并行分划递推
1.
This paper based on the thought of PAR(Partition and Recursion) method, which is proposed by professor XUE Jin yun, gives out the parallel maximum sum algorithms on the PRAM model and supercube interconnection network in optimal time of O(log N) through the method of parallel partitioning data space that we call in a natural way parallel partition and recursion.
在基于薛锦云提出的PAR(Partition and Recursion)方法的思想上 ,通过并行划分数据空间———自然地称之为并行分划递推 ,给出了在PRAM和超立方互联网络模型上的并行最大和最优算法 ,它们的时间复杂性为O(logN) 。
2) partition-and-recur method
分划递推法
1.
The partition-and-recur method is used to derivate and prove the law of disk movement in the problem of Tower of Hanoi by transform of function specification and formalizing deduction.
采用分划递推法通过功能归约变换,形式化推导和证明H ano i塔问题中圆盘的移动规律,从而推导出结构清晰、可读性好、效率高、占用存储空间与圆盘个数无关的非递归算法,算法比较分析地显示出形式化推导在获得高效和正确性的算法程序中的作用。
3) Parallel partitioning
并行划分
1.
Method of SoC-oriented parallel partitioning at system-level;
面向SoC的系统级并行划分方法
2.
Based on the recent trend of SoC development and the effect of parallel partitioning,a method of SoC parallel design at the system-level is presented.
根据SoC发展的趋势,提出了将并行划分技术运用到SoC设计过程中的策略。
4) PAR(partition-and-recur)approach
分划递推方法
5) partition and recur method
分划与递推法
6) recursive programming
递推规划
1.
On non linear recursive programming approach of dynamic portfolio investment;
动态组合证券投资决策非线性递推规划模型
2.
This paper introduces the recursive programming(RP) approach briefly.
简要叙述了递推规划方法，分析了该方法在经济系统描述和优化等方面的特色和优点，并讨论了该方法在理论思想方面的不足之处
3.
Based on multilevel programming and recursive programming,a general dynamic objective coordinating model of multilevel system is established and its optimal approach is researched in this paper,a calculation example is analyzed to show the way how to coordinate the dynamic objective of multilevel system.
本文在多层规划和递推规划的基础上建立了多层系统各层次间局部目标与整体目标、短期目标与长期目标间相互协调的一般模型 ,并对模型的求解方法进行了研究并用一算例说明了多层系统动态目标协调的方法。
补充资料：推下
1.推让;谦让。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条