- 最大流
- max: n. ＝maximum.to the max 最大限度地 ...
- flow: vi. 1.流，流動(dòng)。 2.(血液等)流通，循環(huán)。 3. ...
- fractal flow max: 畫(huà)面扭曲特效
- max-flow min-cut: 最大流最小割; 最大流最小截
- max-flow min-cut theorem: 最大流最小割定理; 最大流最小截定理
下載手機(jī)詞典可隨時(shí)隨地查詞查翻譯
max-flow中文什么意思
- 最大流
下載手機(jī)詞典可隨時(shí)隨地查詞查翻譯
例句與用法
- Paths from start point to end point are founded , and the max - flow of boolean network is got by this way , which avoid conversion of graphics , and time complexity is lowered as well
本論文利用標(biāo)號(hào)法尋求起始點(diǎn)到終點(diǎn)的通路的方法,來(lái)求得布爾網(wǎng)絡(luò)的最大流,使得圖的變換減少,時(shí)間復(fù)雜度也隨之減少。 - By using network flow theory , the optimization problem of power conservation is transformed into the optimal bipartition problem of a flow network which can be partitioned by the max - flow mm - cut algorithm
利用網(wǎng)絡(luò)流理論，將節(jié)約電量的最優(yōu)化問(wèn)題轉(zhuǎn)化為一個(gè)流網(wǎng)絡(luò)的最優(yōu)分割問(wèn)題，而后者可采用最大流最小切割算法實(shí)現(xiàn)最優(yōu)切分。 - Based on the above elementary problems , the relation between system and user equilibrium patterns is discussed and the realization of so pattern is presented . the gap between the user equlirium and system optium is a key factor of the evoluation of the network . and the capcity of a given network is the extension of the max - flow problem
在網(wǎng)絡(luò)需求相對(duì)固定后，系統(tǒng)最優(yōu)目標(biāo)值和用戶平衡目標(biāo)值之間的距離是一個(gè)重要參考指標(biāo)，為宏觀調(diào)控留下了空間，通過(guò)注入管理信息或改變網(wǎng)絡(luò)使用者的網(wǎng)絡(luò)費(fèi)用矩陣，可以達(dá)到用戶平衡下的行為實(shí)現(xiàn)系統(tǒng)最優(yōu)的目標(biāo)。