查询词典 shortest path
- 与 shortest path 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
A new method of slope stability, limit equilibrium finite element method based on Dijkstra algorithm, was established by applying the improved Dijkstra algorithm which was an algorithm to seek the shortest path in graph theory to search for the minimum safety factor of slopes and the position of most dangerous sliding plane.
通过引入图论中解决最短路问题的Dijkstra算法到搜索边坡最危险滑动面及其安全系数中去,对Dijkstra算法作了一定的改进,建立了一种新的边坡稳定性分析方法―基于Dijkstra算法的极限平衡有限元方法。
-
The data in LLE are optimized using the small world algorithm, and the shortest path and the local neighbor set clustering coefficients are used as the local parameters. As a result, the problem of the embedding distortion using only local linear patch of the manifold to define neighborhood in Euclidean space is effectively solved. Three groups of standard data sets are selected to test and to compare the efficiency and robustness of SLLE and LLE.
将复杂网络算法引入到流形学习中,利用小世界算法对LLE算法进行数据优化,并以最短路径和局部集群系数作为局部优化参数,解决了数据点不规则时以欧氏空间作为邻域判别标准在构建局部超平面造成嵌入结果扭曲的难题。
-
In the residual moveout, I firstly describe the Viterbi algorithm based on Markov process and compound decision theory and how to solve the shortest path problem using Viterbi algorithm.
在剩余时差校正中,首先阐述了基于Markov过程和复合判定理论的Viterbi算子;阐述了如何利用Viterbi算子来处理最短路经问题。
-
Example, can be resolved, such as mathematics function approximate maximum shortest path problem. Vb development, very good.
有关遗传算法的例子,可以解决诸如数学中函数近似最大值,最短路径的问题。vb开发的,很好的。
-
For the purpose of solving the shortest path problem between any two nodes on urban traffic networks, We present a mixed connected graph representing the urban transportation networks, and choice set of main line is proposed in our disertation, according to urban road layout and rule of vehicle rout, we supposed a multi-phase labeling algothrim base on classical Dijskra labeling algorithm, a list of examples for all possible relation between two nodes are provided, all the examples is calculated by the proposed computer program, which indicates that this algorithm is feasible and effective.
为了研究城市路网上任意两顶点间的最短路问题,结合城市交通特点提出了最小干线选择集的概念,在著名的Dijkstra算法基础上,根据城市路网布局和配送车辆行车规则,给出一种多阶段定向搜索标号算法。
-
The effectiveness of this method depends basically on two values,Гmin the search is faster for larger Гmin and the size of Pref (RE (the search is faster for less prefixes), where Гmin donate the shortest path from the initial state to a final state of the Nondeterministic Finite Automaton and Pref the prefixes of length Гmin for all the strings matching the regular expression. The size of Pref can be exponential in m and for multiple expressions matching the Pref will be much larger.
现有的正则表达式搜索算法性能较好的是多模式过滤类型的算法,此类算法严重依赖于两个因素,从NFA的初始状态到终止状态的最短路径Lmin和正则表达式所表达的语言的前缀集合Pref的大小,Lmin越长,搜索速度越快,Pref越大,搜索速度越慢。
-
In the beginning of the 90s, it was realized in a nonscientific way, which was based on the router configure——assigning the traffic streaming simply onto the shortest path by IGP.
这种映射的实现只是基于产品的路由配置——业务流简单地被分配到内部网关协议IGP计算出的最短路径上。
-
Open the map document, known for the shortest path to the road system.
打开地图文件,对已知道路系统求最短路径。
-
Based on the "shortest path matrix", the selected characteristic indices-distance, time and speed, this paper analyses the current spatial structure of accessibility in the cities which the national trunk highway system connects, and impacts the speed index made.
以"最短路径模型"为基础,选取距离与时间两个特征指标以及联结两者的速度指标,分析了目前中国国家干线公路网络联结的城市通达性空间格局。
-
Highway ; Shortest Path Matrix ; Accessibility Index ; Central Liaoning Urban Agglomeration
高等级公路;最短路径矩阵;通达指数;辽宁中部城市群
- 推荐网络例句
-
As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.
每逢看到沃林顿那刚毅的脸,那乌黑、忧郁的眼睛,她便会相信,他一定作过不幸的爱情的受害者。
-
Maybe they'll disappear into a pothole.
也许他们将在壶穴里消失
-
But because of its youthful corporate culture—most people are hustled out of the door in their mid-40s—it had no one to send.
但是因为该公司年轻的企业文化——大多数员工在40来岁的时候都被请出公司——一时间没有好的人选。