• After studying conditions for generating PODCM in the critical path of data flow graph (DFG), an algorithm was introduced to produce PODCM.

    通过分析数据(DFG)关键路径生成PODCM条件,给出了DF G关键路径上生成PODCM算法并建立了PODCM库。

    youdao

  • The result is that the delay-Jitter-SPF algorithm and the flow graph of the building of the multicast tree with QoS constraints are proposed.

    结果提出了基于延迟延迟抖动约束SPF算法,并给出完整的建立组播流程图

    youdao

  • The algorithm is based on the principle of flow graph theory and set theory.

    算法基于理论基本原理简单的集合运算,概念明确,易于掌握;

    youdao

  • The characteristics of dynamic liquid composition graph are analyzed. The main algorithm flow descriptions and implementation examples are shown, and main features of this algorithm are summarized.

    分析动态液体构图特点给出主要算法流程描述算法实现实例总结了算法的主要特点

    youdao

  • The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.

    首先对给定的数据进行单电压高层次综合,然后对单电压综合结果迭代地进行多电压调整提取每次迭代时需要调整的网络流子图,对该子图运行最小费用最大流增量算法。

    youdao

  • The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.

    首先对给定的数据进行单电压高层次综合,然后对单电压综合结果迭代地进行多电压调整提取每次迭代时需要调整的网络流子图,对该子图运行最小费用最大流增量算法。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定