您要查找的是不是：
- Finally, Chapter eleven covers the special topics of the maximal flow problem, the shortest path problem, and the multicommodity minimal cost flow problem. 最后，第十一章覆蓋了特殊主題：最大化流問(wèn)題、最短路徑問(wèn)題和多物最小消費流問(wèn)題。
- Successive two days all the time is have loose bowels alvine path problem? 連續兩天一直拉肚子是腸道問(wèn)題么？
- This paper deals with TSP by transform TSP to a special Shortest Path Problem. 本文將解決TSP問(wèn)題轉化為一種特殊的最短路問(wèn)題。
- Biomolecular computing has been successfully applied in computing NP complete problems such as Hamiltonion path problem, maximal clique problem and SAT problems in Boolean calculation, etc. 生物分子計算已成功地應用于計算哈密頓路徑、最大集合以及邏輯運算中的SAT類(lèi)問(wèn)題等 NP完全問(wèn)題。
- There are two major types of class path problems. 主要有兩種類(lèi)型的類(lèi)路徑問(wèn)題。
- 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)行了分析;
- 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è)圖中找這樣的路，使其權最大，費用最少。
- 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ò )。
- 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)題的求解。
- This paper addresses sensitivity analysis questions concerning the shortest path problem and the maximum capacity path problem in an undirected network. 本論文旨在評估分散型電源在常閉環(huán)路配電饋線(xiàn)上之最大可并網(wǎng)量。
- They cleaved a path through the wilderness. 他們在荒原中開(kāi)辟出一條路。
- 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)化遺傳算法,提出相應的編碼方案和適應度的計算。
- This paper aims at the most vital node of the shortest path problem under uncertainty (MVN-U).Firstly, this paper states the concept of the most vital node of the shortest path under uncertainty. 對該問(wèn)題，以前的文獻都是從確定情形（事先具有節點(diǎn)中斷的完全信息）下進(jìn)行研究的，本文從不確定情形（只有數據包行進(jìn)到中斷節點(diǎn)的鄰接點(diǎn)時(shí)才獲得該節點(diǎn)中斷的信息）的角度重新考慮這個(gè)問(wèn)題。
- She will be a maximal help to here. 她到這兒將是個(gè)極大的幫助。
- She obtained maximal benefit from the course. 她從該課程中獲益極大。
- She squelched along the muddy path. 她沿著(zhù)泥濘小徑格吱格吱地走。
- "Waste not, want not" is her favorite maxim. “不浪費則不匱乏”是她特別喜愛(ài)的格言。
- He was destined to plod the path of toil. 他注定要在艱辛的道路上跋涉。
- Algorithm DIMCRA can solve link disjoint paths problem with multiple additive constraints well. DIMCRA算法能很好地解決多個(gè)加性約束下的鏈路分離路徑問(wèn)題的算法。
