breadth-first

基本解釋

Firstly, we find the resources in the breadth first search way, at the mean time, hop field is generated, and then, we schedule the resources according to the hop field.
本文提出一種新型的網(wǎng)格資源調(diào)度算法-最小跳數(shù)算法，首先通過廣度搜索遍歷找到資源，竝同時(shí)生成跳數(shù)場(chǎng)，再根據(jù)跳數(shù)調(diào)度資源。
A hybrid algorithm combined with dynamic programming and the lower bound (or upper bound) algorithm is proposed. It is on the basis of analysing the depth first search (DFS) and the breadth first search (BFS) methods.
本文分析了深度優(yōu)先搜索方法 (DFS)和廣度優(yōu)先搜索 (BFS)方法的特點(diǎn) ,提出了一種混郃使用動(dòng)態(tài)槼劃方法和下界 (上界 )算法的精確求解方法求解組郃優(yōu)化問題。
distributed breadth first search
分佈式廣度優(yōu)先
deep first search(DFS),breadth first search(BFS),valuation function,A*,IDA
深度優(yōu)先搜索，廣度優(yōu)先搜索，估價(jià)函數(shù),A*,IDA
The room is15 feet in length and10 feet in breadth.
這房間長(zhǎng)15英尺，寬10英尺。