Sentence examples for searching steps from inspiring English sources

With six heuristic searching steps, the decoding process is stopped.

These bees will work together in three searching steps to update food resources.

When the number of searching steps is greater than n s, we stop and return the current local minimizer.

In the onlooker bees searching steps, we introduce a new method called pheromone and sensitivity model as an alternative of roulette method.

In the onlooker bee searching steps, roulette is a greedy method, which will cause solutions to be trapped into local optimum.

Therefore, when the number of searching steps is greater than n s, we can consider that the best local minimizer has been obtained and it is not necessary to continue searching.

In the employed bee searching step and onlooker bees searching step, we propose a preferential exchange strategy.

During the previous employed bee searching step and onlooker bees searching step, the update formula is as follows: V j)={X_{i}}(j)+ text{rand} -1,1))({X_{i} -1,1{X_{i}}(j -{X_{r}

Initial conditions: Suppose that the initial searching step L, which is the search length on the contour, is 1/5 of the character height.

In the proposed algorithm, firstly, π(k) is computed by increasing λ in each searching step for m = 1 as shown in Steps (1 5).

In the fine searching step, the design parameters are determined by using the optimization technique of the conjugate gradient method in the overall FPRs.