您要查找的是不是:
- Searching shortest path 最短路径搜索
- Search Shortest Path Pieeewise 分段路径寻优
- In intelligent traffic navigation or dynamic path abduction systems, the shortest path searching is the basic function. 在智能交通的导航/动态路线诱导系统中,最短路径搜寻是其重要功能。
- Shortest Path Transit Network Settings. 最短路径公交网络对话框。
- The keypoint of the thesis is how to solution the problem of the tigers' searching the fox applied the shortest path algorithm. 本文的重点在于介绍如何使用最短路径算法来解决老虎搜索狐狸的问题。
- Use a short path name if you can. 如果可以,请使用短路径名称。
- However,shortcut is the shortest path but not will be the fastest. 然而,快捷方式虽然是最短的路,却未必是最快的。
- The next page will discuss the shortest path algorithm. 下一页将讨论最短路径演算法。
- Combining fuzzy clustering analysis and genetic algorithm, a gradational searching algorithm of shortest path in laser cutting is presented. The method can also be used in similar optimum problems. 结合激光切割最短路径的计算问题,将模糊聚类分析与遗传算法相结合,提出了一种分级搜索最短路径的方法,该方法对于同类问题的解决具有借鉴作用。
- Make sure that the path name is in a short path (DOS 8.3) format. 确保路径名称为短路径(DOS 8.;3)格式。
- This name may not initially appear to be a short path name. 此名称初看起来不像是短路径名称。
- The tools can be stochastic choose through shortest path from bidirectional. 双向随机最短路径选刀。
- And alters their values to find a curve that flows along the shortest path. 并对其值进行调整以找到路径最短的曲线。
- Redundant links that are not part of the shortest path tree are blocked. 不是最短路径的备援连结将被阻隔。
- It uses Diffusing Update Algorithm (DUAL) to calculate the shortest path. 它使用散布更新演算法(DUAL)来计算最短路径。
- The entrance is situated down a short path leading off Brick Lane. 入口位于一条通向布里克巷的不长的小路里面。
- This paper deals with TSP by transform TSP to a special Shortest Path Problem. 本文将解决TSP问题转化为一种特殊的最短路问题。
- Once we have simplified our search area into a manageable number of nodes, as we have done with the grid layout above, the next step is to conduct a search to find the shortest path. 一旦我们把搜索区域简化成了可以管理的大量节点,就象我们上面所做的那样采用格子的布局,下一步就是引导一个搜索来找出最短路径。
- To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution. 为了求解上述模型;首先利用FLOYD算法求得不完全无向图中各节点间的最短路径和最短路径长度;然后设计了捕食搜索算法对模型进行求解.
- Shortest path is based on cumulative link costs. Link costs are based on the speed of the link. 最短的路径是依据累计的连结成本来决定的。连结成本是依据连结速度来决定的。
- 今日热词
-
- 深远海浮式风电平台 - deep-sea floating wind power platform
-
- 京雄高速公路 - Beijing-Xiongan expressway
-
- 农业及相关产业增加值 - the added value of agriculture and related industries