directed acyclic graph的意思|示意
[计] 有向非循环图
directed acyclic graph的网络常见释义
有向无环图 ...要求很高,随着多核处理器的普及,多核环境下的动态并行加速已成为提高解码性能的有效方式[6]。有向无环图(directed acyclic graph,DAG)是描述动态系统时序过程的有效工具。
有向非循环图 WinFS 时存在，不能允许Dangling Relationship的存在。 （4）实例间的关系不能形成回路，构成一个有向非循环图（Directed acyclic graph，DAG）。 （5）Holding Relationship采用层次式的命名空间（如上所示），每一个这样的Re
无回路有向图 模型的几何、尺寸、外观、位置以及相互关系组成一个无回路有向图(Directed Acyclic Graph)， 那些数据的功能性通过字段参数的形式包含在节点中，字段参数可以包含简答数据类型的数值或 者是其他的节点。
环图 ...ntry 10 2 entry 3 entry in 9 8 in 7 6 in 5 4 type 2011-4-18 22 属性计算顺序 有向非循环图（directed acyclic graph）的拓 扑排序（topological sort）： 图中所有结点的一个排列 若m i →m j 是一有向边，则在结点序列中m i 在m j 的前面 20...
directed acyclic graph相关短语
1、 directed acyclic graph DAG 有向无环图 ; 有向无回图
2、 decision directed acyclic graph 决策导向无环图 ; 决策导向的循环图 ; 决策有向无环图 ; 法
3、 directed acyclic graph model 有向无环图模型
directed acyclic graph相关例句
Directed acyclic graph support vector (DAG - SVMS) multi - category classification methods, is a new multi - category classification methods.
有向无环图支持向量(DAG - SVMS)多类分类方法，是一种新的多类分类方法。
The dependency structure between packages must be a directed acyclic graph (DAG).
包之间的依赖结构必须是一个直接的无环图形(DAG)。
Is it practical to store unique paths through a directed acyclic graph?
这是存储唯一的路径通过一个有向无环图的现实？
A product type hierarchy is a strict tree, whereas a category hierarchy can be a directed acyclic graph.
产品类型层次结构是一个严格的树，而类别层次结构则是一个有方向的非循环图表。
A "priority queue" which has a linked structure is used in this algorithm, which insures to complete LTP with the vertices in directed acyclic graph.
在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。
A constructible definition of the directed acyclic graph was described, and the reason why exists a solution that does not exceed the total execution time of all tasks was explained.
描述了有向无回路图的构造性定义，指出问题一定有不超过所有任务执行时间总和的解。