• And then the control method based on weighted graph was presented.

    然后提出一种基于加权无向图控制方法

    youdao

  • In this thesis, grid partitioning is converted to an unoriented and weighted graph, on which partitioning algorithm is studied.

    本文将网格分区问题转化赋权的分区,图上研究分区算法

    youdao

  • Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.

    最终推出任意无向加权图K连通最小扩充的模拟退火算法

    youdao

  • We present a novel perspective on characterizing the spectral correspondence between nodes of the weighted graph with application to image registration.

    本文提出了一种新的基于谱图矩阵扰动分析的顶点对应图像配准方法。

    youdao

  • This paper discusses algorithms of the shortest path in a weighted graph as well as the shortest path transformations resulted from it, and gives a simple program solving problem of MATLAB.

    讨论带权最短路径算法及其若干个变形问题的算法,MATLAB软件环境下对最短路径问题给出了一个简捷易懂程序

    youdao

  • The surface painting of rotor and the place of optoelectronic sensors, and then a weighted graph is given according to the structural characteristics and kinetics characteristics of the stepper.

    介绍了永磁球形电机定子、转子结构,电机转子表面着色原理以及电机定子上的光电传感器放置

    youdao

  • This paper proposes a novel spectral partitioning algorithm, viz. recursive spectral bisection, for weighted graph partitioning that models large scale distribution feeder reconfiguration problem.

    建立了配电网络重构的多划分模型提出基于图的划分的算法,用于求解大规模配电网络的馈线间重构问题。

    youdao

  • This paper use weighted directed graph to describe user visit and conversation records, and use clustering algorithms to realize the page clustering by the weighted directed graph mode established.

    利用表示用户访问会话记录,对建立的有向带权图模型运用算法实现页面聚类。

    youdao

  • This article gives a solution to the programming 0-1 problem whose objective function is a nonlinear function, by applying weighted bipartite graph and perfect matching.

    本文目标函数非线性函数的0—1规划问题提出了一种运用赋权完美集的求解方法

    youdao

  • A new chromatographic separation criterion, peak-purity weighted resolution based on rank graph is proposed.

    我们提出了一种新的基于色谱分离评价指标—峰纯度加权分辨率

    youdao

  • Secondly, based on distributing the free parking spot into the weighted directed graph, this paper calculates the shortest path with the ant colony algorithm.

    其次将停车场空闲车位分布转化一带权有向基础蚁群算法进行最短路径计算

    youdao

  • This Paper provides an algorithm of topological sequencing for weighted directed graph, and illustrates its application with an example.

    提出种有向拓扑排序算法给出一实例说明应用

    youdao

  • In order to solve the intelligent transportation system in transportation network analysis and the shortest path problem, this paper proposes a weighted identification S-graph shortest path algorithm.

    解决智能交通系统交通运输网络分析最短路径问题提出加权标识s -图最短路径算法

    youdao

  • The other is weighted bar graph approach which can detect a target in broadband coherent interference and estimate its azimuth Angle.

    加权直方图方位估计宽带相干干扰检测目标,估计目标方位。

    youdao

  • The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.

    表示电路超图转化带权值无向从而电路二等分问题转化成图的划分问题。

    youdao

  • Secondly, based on the defined priority principle of Fault Prediction and using the Fault Prediction allowance value set got by weighted algorithm, a sequential graph of FP is designed.

    然后定义了故障预测优先原则基础利用专家系统加权算法得到故障预测容许集合,设计了故障预测的流程图

    youdao

  • Large networks attack can be researched base on the graph theory, because the character of its network connect and route of spread is related closely to weighted and oriented graph.

    由于大规模网络入侵网络连接上、传播路径上所体现出来特性中的赋权有图有着共同的特性,这使得在图论的基础进行大规模网络入侵检测的研究成为可能

    youdao

  • Experimental results show that the weighted identification S-graph shortest path algorithm for solving the transport network is an effective method for the shortest path.

    结果表明加权标识s -图最短路径算法能够有效地求解交通网络最短路径。

    youdao

  • Experimental results show that the weighted identification S-graph shortest path algorithm for solving the transport network is an effective method for the shortest path.

    结果表明加权标识s -图最短路径算法能够有效地求解交通网络最短路径。

    youdao

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

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

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