Sentence examples for a reasonably good solution from inspiring English sources

One difficulty often encountered in genetic programming is that of the algorithms becoming stuck in the region of a reasonably good solution (a "locally optimal region") rather than finding the best solution (a "global optimum").

Therefore, it is unfair to depend on a heuristic method which gives a reasonably good solution, if not the global one, with less computational effort.

Although the heuristic algorithm leads to a suboptimal solution, it provides a reasonably good solution in the limited time, which works well in the practical applications of the assigning frequencies to the CR SUs.

Thus to obtain a reasonably good solution, in numerical experiments, we apply GA many times, and obtain an optimal solution from all the results obtained.

During the last decade, PSO algorithms have gained much attention and wide applications in different fields due to their effectiveness in performing difficult optimization issues, as well as simplicity of implementation and ability of fast converge to a reasonably good solution.

It is of interest to make a practical remark here: cases shown in Fig. 4 panels c and e are largely irrelevant from a practical point of view as any robot learning system of this kind would either have to be controlled by an operator or at least would require a stopping criterion, which tells the machine to stop as soon as it has found a reasonably good solution.

Through GIS-functionality, planners are able to evaluate a range of reasonably good solutions (i.e., from an ecological perspective), in the context of other considerations, such as economics or political expediency.

This comparison is helpful to conclude that the iterative approach gives reasonably good solutions with an acceptable complexity.

In the latter case, the performance of the iterative technique and the GP method has been compared with simulations to ensure that the iterative approach gives reasonably good solutions with an acceptable complexity.

DCCF was designed to run in a distributed way, in order to be fast and to provide reasonably good solutions.

The experiments using a formulation of the traveling salesman problem show that the algorithm can find reasonably good solutions for noisy objective landscapes with inexact derivatives information.