And then the control method based on weighted graph was presented.
然后提出了一种基于加权无向图的控制方法。
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软件环境下对最短路径问题给出了一个简捷易懂的程序。
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规划问题提出了一种运用赋权偶图及完美对集的求解方法。
A new chromatographic separation criterion, peak-purity weighted resolution based on rank graph is proposed.
我们提出了一种新的基于秩图的色谱分离评价指标—峰纯度加权分辨率。
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.
利用有向带权图表示用户的访问会话记录，对建立的有向带权图模型运用聚类算法实现页面聚类。
Secondly, based on distributing the free parking spot into the weighted directed graph, this paper calculates the shortest path with the ant colony algorithm.
其次，将停车场空闲车位的分布转化为一带权有向图，在此基础上用蚁群算法进行了最短路径计算。
We present a novel perspective on characterizing the spectral correspondence between nodes of the weighted graph with application to image registration.
本文提出了一种新的基于谱图矩阵扰动分析的权图顶点对应的图像配准方法。
This Paper provides an algorithm of topological sequencing for weighted directed graph, and illustrates its application with an example.
提出一种有向权图的拓扑排序算法，并给出一实例说明其应用。
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 -图最短路径算法。
The other is weighted bar graph approach which can detect a target in broadband coherent interference and estimate its azimuth Angle.
加权直方图方位估计法能从宽带相干干扰中检测目标，估计目标方位。
The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.
将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。
Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.
最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。
In this thesis, grid partitioning is converted to an unoriented and weighted graph, on which partitioning algorithm is studied.
本文将网格分区问题转化为无向赋权图的分区，在图上研究分区算法。
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.
然后在定义了故障预测的优先原则的基础上，利用专家系统加权算法得到的故障预测容许值集合，设计了故障预测的流程图；
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.
由于大规模网络入侵在网络连接上、传播路径上所体现出来的特性与图论中的赋权有向图有着共同的特性，这使得在图论的基础上进行大规模网络入侵检测的研究成为可能。
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.
介绍了该永磁球形步进电机定子、转子的结构，电机转子表面的着色原理以及电机定子上的光电传感器的放置；
This paper proposes a novel spectral partitioning algorithm, viz. recursive spectral bisection, for weighted graph partitioning that models large scale distribution feeder reconfiguration problem.
建立了配电网络重构的图的多划分模型，提出了基于图的谱划分的算法，用于求解大规模配电网络的馈线间重构问题。
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 -图最短路径算法能够更有效地求解交通网络最短路径。
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 -图最短路径算法能够更有效地求解交通网络最短路径。
应用推荐