Sentence examples for using a heuristic algorithm from inspiring English sources

Routing was formulated as an optimal routing problem based on new cost, using a heuristic algorithm.

Alternative paths between routers requiring communication have been generated using a heuristic algorithm.

Sathya's proposed work aims to detect the attacks on SDN environment by using a heuristic algorithm inspired by the echolocation behavior of bats.

Horizontal ensemble framework tends to selecting the same type of classifiers and train them independently on different data-chunks, then using a heuristic algorithm to organize them together.

Liu and Lau [128] studied the joint optimization of RRH selection, regularization factor in RZF precoding, and power allocation, where the RRH selection is adaptive to the global path gain matrix using a heuristic algorithm based on the deterministic equivalent [129] of the average rate and power.

Because most of these Lambert function calls would not converge to feasible solutions, it is much more efficient to prune the solution space using a heuristic algorithm and then direct a much smaller number of Lambert function calls to find feasible triple flyby solutions.

Therefore, to reduce the number of channels, the authors used a heuristic algorithm, namely, l 1 norm, to select the most useful channels, and then extract the features from the selected channels using the CSP.

Then it uses a heuristic algorithm to organizing them together.

Akkan (1998) used a heuristic algorithm based on Lagrange released, while Liu et al. (2000) used genetic algorithm (GA) for solving DTCTP and Elmaghraby and Kamburowski (1992) considered reward and penalty on objective function.

Also, they noticed that some noisy regions are likely to have a higher strength which cannot be eliminated even by using high threshold value and proposed to use a heuristic algorithm based on the corresponding Gabor response.

It uses a heuristic algorithm and employs n+1 different wavelengths of a light ray, to check whether a Hamiltonian path exists or not on a graph with n vertices.