例句與造句

1. Unfortunately , the problem of finding multicast routing with qos constrained is a np - complete problem . so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra
   然而研究表明，由于qos組播路由帶有多個(gè)qos約束參數(shù)，因此qos組播路由問題是一個(gè)np完全問題，這使得它與傳統(tǒng)的路由過程不同，難以用經(jīng)典的最短路徑優(yōu)先算法求解。
2. The thesis then studies the emulation modes of routing algorithms with inaccurate network state information , proposes a simulation model based on events for routing algorithms with inaccurate network state information , and develops a routing simulation software r - ns that provides an effective environment for the research of network routing algorithms . randomized routing algorithms based on improved dijkstra and bellman - ford algorithms are proposed for the unicast routing model with inaccurate network state information
   本文研究了非精確網(wǎng)絡(luò)狀態(tài)信息的路由算法模擬仿真方法，提出了非精確網(wǎng)絡(luò)狀態(tài)信息下基于事件的網(wǎng)絡(luò)路由模擬仿真模型，設(shè)計(jì)并實(shí)現(xiàn)了路由模擬仿真軟件rns ，對(duì)網(wǎng)絡(luò)路由算法的研究提供了很好的支撐環(huán)境。
3. It's difficult to find bellman-ford in a sentence. 用bellman-ford造句挺難的