• At last, applying the distance graph of the reduced decision table, we propose a way to get the core of each decision rule.

    最后,建立了一个利用约简决策表的距离图求决策规则的核值及最小决策算法的算法框架。

    youdao

  • This paper proposed a new contour reconstruction method combining multi-scale strategy, and the core component of new method is edge distance graph algorithm.

    设计了一种将轮廓线三维建模与多尺度二维图像处理技术相结合的新方法。该方法的核心是边缘距离图算法。

    youdao

  • In particular, some upper bounds of the vertex arboricity of the integer distance graph G(Z, D) are obtained when D is a set of positive integers and Z the set of all integers.

    特别地,当D是某正整数集合,Z是整数集时,得出了整数距离图G(Z ,D)的点荫度的几个上界。

    youdao

  • Distance functions for Volume, Pan, Spread and Low-Pass audio filter. The current distance to the Audio Listener is marked in the graph.

    音量,平衡调整,扩散和低通音频滤波器的距离函数。当前到音频监侦听器的距离在图中标记。

    youdao

  • The diameter and average distance of a graph are two important parameters to measure the efficiency of interconnection networks.

    图的直径和平均距离是度量网络有效性的两个重要参数。

    youdao

  • For this algorithm, a new definition of components graph is described and good locality of algorithm is developed in use of lower distance.

    该算法给出了新的区域关系图的定义,并利用了基于下降距离的方法的局部性;

    youdao

  • The diameter of a graph G is the maximum distance between pairs of vertices of G .

    一个图G的直径是G的所有点对间距离的最大值。

    youdao

  • As an appendix, expression for escape sign, size of Graph and letter, colour, brightness, brightness contrast, visibility and apparent distance are also listed from technical requirements.

    作为附录,还列出了疏散标志的表示方法、图形文字尺寸、颜色、亮度、亮度比、可见度、视距等技术要求。

    youdao

  • The graph model was applied to solve the vehicle routing problem with full load (VRPFL) and a driving distance restriction.

    结果表明,该方法能有效地解决有行驶里程限制的满载车辆调度问题。

    youdao

  • Then, the paper essentializes the two key problems in the course of building a three-dimensional monitor network: the optimum geometrical graph and the precision distance surveying.

    同时,简要分析了建立高精度的测边三维监测网的两个关键问题,即最优构形和精密光波测距。

    youdao

  • Introduces the algorithm using dynamic programming to search the shortest distance between two points in graph, and compares the complexity with ordinary method.

    本文介绍了利用动态规划法来寻找图中任意两点间最短距离的算法,并将其时间复杂度与一般方法作了比较。

    youdao

  • A new Splitting Strategy of Power Systems based on Electric-distance and Graph Theory is proposed.

    提出了基于图论和电气距离的电力系统解列策略搜索新算法。

    youdao

  • A new Splitting Strategy of Power Systems based on Electric-distance and Graph Theory is proposed.

    提出了基于图论和电气距离的电力系统解列策略搜索新算法。

    youdao

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

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

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