大家在查：风度地 hatchbacks snuggest 肪 kitting lawful act RichardPickard coalfields MaLingDao kwhr

不相交

na.non-intersect
网络disjoint; non-overlapping; disjointwith

不相交

英-汉网络释义

不相交

disjoint

通过指定类之间的关系是不相交 (disjoint) 来避免一个子类同属两个父类的情况出现。 3.Protege 中将属性分为对象属性 (Object …

non-overlapping

不相交(non-overlapping)：如果2个区间最多只在公共边界相交；受限多边形(restricted polygon)：顶点被限制在几段连续的不 …

disjointwith

...ul- try 与 Livestock 的属性设置不相交 (disjointwith)，DaBin 为 Duck 的个体实例，TOM为Dog 的个体实例，并且设置DaBin …

Disjoint union

编译原理术语中英文对照表 - 豆丁网 ... Disambiguating rules 无二义性规则 Disjoint union 不相交 Display table Display 表 ...

non-intersect

skew line是指在3D中不平衡(non-parellel)不相交(non-intersect)的两条lines这题书内没答案... 再请数学达人帮忙＞.＜很急因为 …

例句：

A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains.

如果一个偏序集可以分解成不相交的对称链之并，则称此偏序集具有对称链分解。

Most of these classes must be disjointed .

这些类别大部分是不相交的。

Notice that the area of the second region that does not intersect with the first region is colored blue .

请注意，第二个区域中与第一个区域不相交的区域颜色是蓝色。

It is called Parallel that two beelines don't intersect each other in the same plane .

在同一平面内不相交的两条直线叫做平行线。

In this paper, the authors develop a routing mechanism where sensor nodes can send data to sink through node-disjoint paths.

提出了一种不相交路径路由算法，可以将感知节点采集到的数据通过不相交路径传送到；

A new scheme called reliable node-disjoint multipath routing algorithm (RNDMRA) is presented .

提出了一种可靠的节点不相交多路径路由算法（RNDMRA ）。

We present the Maximum Disjoint Sets for Maintaining Coverage and Connectivity (MDS-MCC) problem, and we prove it is NP-complete .

在这一章节中我们将介绍保证覆盖和连同的最大化不相交节点结合问题（MDS-MCC ），同时我们证明这个问题是 NP 完全的。

Note that one requires "global " maximality, not just maximality with respect to being disjoint from F .

注意你需要 “全局 ”极大性，而不只是关于不相交于 F 的极大性。

An Algorithm for Connecting Non-Intersecting Line Segments into a Simple Polygon (Line )

连接不相交线段成简单多边形（链）的算法

Formally, horizontal partitioning or sharding P (D ) of a dataset D is a decomposition of D into N mutually disjoint sets Di such that

正式来讲，对数据集 D 的 P （D ）进行水平分区或划分就是将 D 分解成相互不相交的 N 个集 Di 且

Multipath Disjoint Routing Algorithm for Bluetooth Scatternet

蓝牙分散网的多径不相交的路由算法

Improvement and Analysis of Widest Disjoint Paths Algorithm for Proportional Routing

最宽不相交多路径均衡路由算法的改进及其分析

a reliable node - disjoint multipath routing algorithm in mobile ad - hoc networks

网络中一种可靠的节点不相交多路径路由算法

On Number of Cosets in Non-Natural Disjoint Covering Systems

不相交覆盖系统中的陪集数

不相交

不相交

disjoint

non-overlapping

disjointwith

Disjoint union

non-intersect

热词推荐

大家在看