您要查找的是不是：
- Let G be a digraph.The two-objective optimal path problem is to find a path which has the maximum weight and minimum cost in G. 雙目標最優(yōu)路問(wèn)題是指在一個(gè)圖中找這樣的路，使其權最大，費用最少。
- In the case of the Shortest Paths problem we showed that if vk is a vertex on an optimal path form vi to vj , then the subpaths from vi to vk and from vk to vj must also be optimal. 每一個(gè)輸入的計算都必須是根據其馀輸入的最佳結果再進(jìn)一步計算，如此才能夠得到最佳解，同時(shí)可以將無(wú)法獲得最佳解的情況去除，以避免需要將每一種可能情況都加以考慮。
- A Study of DAG Graph Optimal Path Problem on Time Constrained 基于時(shí)間約束的DAG圖上的最短路徑算法研究
- A Model and Algorithm for the Optimal Path Problem Considering the Network Flow 考慮網(wǎng)絡(luò )流量的最優(yōu)路徑求解模型和算法
- By pre-computing and storing viewshed information, the optimal visual coverage path problem is resolved using simulated annealing algorithm based on viewshed amalgamation. 通過(guò)預先計算并存儲視域信息，采用基于視域融合的模擬退火算法實(shí)現了該問(wèn)題的求解。
- Successive two days all the time is have loose bowels alvine path problem? 連續兩天一直拉肚子是腸道問(wèn)題么？
- There are two major types of class path problems. 主要有兩種類(lèi)型的類(lèi)路徑問(wèn)題。
- This paper deals with TSP by transform TSP to a special Shortest Path Problem. 本文將解決TSP問(wèn)題轉化為一種特殊的最短路問(wèn)題。
- A virus evolutionary genetic algorithm is designed and the corresponding coding scheme and the calculation method of adaptability are proposed to solve the optimal dynamic path problem in vehicle navigation. 針對車(chē)輛導航的動(dòng)態(tài)最優(yōu)路徑問(wèn)題,設計一種病毒進(jìn)化遺傳算法,提出相應的編碼方案和適應度的計算。
- The optimal path is chosen considering variables such as cost, message type, and restrictions. 最佳路徑是根據開(kāi)銷(xiāo)、郵件類(lèi)型和限制等變量來(lái)選擇的。
- At which layer of the OSI model is the optimal path to a network destination determined at? 在OSI模型的哪一層實(shí)現對網(wǎng)絡(luò )目標路徑的優(yōu)化選擇？
- This procedure using genetic algorithm, to solve the array data structure for the selection of the optimal path. 本程序運用了遺傳算法，解決了以數組為數據結構的最優(yōu)路徑選擇問(wèn)題。
- Static network means the concentrators calculate out one or several optimal path according to the historical data. 靜態(tài)組網(wǎng)，是集中器根據歷史數據計算出來(lái)的一條或幾條最佳路徑。
- In conclusion, the thesis recommends, an optimal path to evolve S12 PSTN exchange (subscriber modules) to NGN. 總之，本論文指出了S12交換機用戶(hù)接口部分向NGN演進(jìn)的一個(gè)優(yōu)化途徑。
- Based on this analysis, we propose approximate algorithms on BCP and RSP(restricted shortest path problem) and make performance analysis on them. 基于以上分析,我們給出了BCP和單約束最短路徑問(wèn)題(RSP,restricted shortest path problem)的近似算法,并對算法性能進(jìn)行了分析;
- The row holds watchful husband high " drive " model can the optimal path of computative economy structural adjustment. 列昂惕夫“快車(chē)道”模型能夠推算經(jīng)濟結構調整的最優(yōu)軌道。
- Concept and implement of graph, basic operations of graph, minimum cost spanning tree, shortest path problem, AOV and AOE network. 圖的概念和實(shí)現；圖的基本操作；最小價(jià)值生成樹(shù)；最短路徑；活動(dòng)網(wǎng)絡(luò )。
- Results of computer simulation experiment indicate that the method can implement optimal path planning in complex environments. 仿真實(shí)驗結果表明，該方法在復雜環(huán)境中能有效地實(shí)現最優(yōu)路徑規劃；
- Simulation results indicate that this optimal path is efficient, rapid and safty and can avoid parochialism in single attribute decision making system. 數值仿真結果表明，多屬性決策系統所選擇的最優(yōu)路徑，兼顧節能、快速、安全等因素，避免了單屬性決策的片面性。
