有向无环图指的是一个无回路的有向图。如果有一个非有向无环图,且A点出发向B经C可回到A,形成一个环。将从C到A的边方向改为从A到C,则变成有向无环图。有向无环图的生成树个数等于入度非零的节点的入度积。
...要求很高,随着多核处理器的普及,多核环境下的动态并行加速已成为提高解码性能的有效方式[6]。有向无环图(directed acyclic graph,DAG)是描述动态系统时序过程的有效工具。
基于3222个网页-相关网页
.其中8s为贝叶斯模 型网络结构,Bs=(X,E)是一个有向无环图(DAG,DirectedAcyclieGraph), X=ix,五,…
基于4个网页-相关网页
... docin.com豆丁网 .2.4 TORA(Temporally—OrderedRoutingAlgorithm) TORA乜妇协议是在有向无环图(DirectedAcyclicGraphic,DAG)算法瞄羽的基础上提 出的一种按需路由协议。它分为路由发现、路由维护和路由消除三个过程。
基于4个网页-相关网页
有向无环图法 DAGSVM ; Directed Acyclic Graph ; DGA
有向无环图分类法 directed acyclic gragh
和有向无环图法 Directed Acyclic Graph ; DAG
支持有向无环图 Directed Acycline Graph ; DAG
决策有向无环图 decision directed acyclic graph ; DDAG
是一个有向无环图 Directed Acyclic Graph ; DA
成的两个有向无环图 Direct Acyclic Graph ; DAG
针对有向无环图 directed acrylic graph
还有有向无环图的概念 directed acyclic graph ; DAG
For this problem we mainly study the special case of directed acyclic graph, general graph case is one of our future directions.2.
对于低度网络设计问题,我们主要集中研究了有向无环图上的情况,一般的有向图情况将是我们进一步研究的方向之一。
参考来源 - 若干组合优化问题的算法研究·2,447,543篇论文数据,部分数据来源于NoteExpress
算法来找到一个层次树在一个有向无环图吗?
Algorithm to find a hierarchy tree in a directed acyclic graph?
这是存储唯一的路径通过一个有向无环图的现实?
Is it practical to store unique paths through a directed acyclic graph?
的n阶有向无环图的拓扑排序的可能的最大数量是多少?
What is the maximum number of possible topological sorts of N-order Direct Acyclic Graph?
应用推荐