Examples of using Heuristic method in English and their translations into Portuguese
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
The algorithms had as base heuristic methods built in two phases,
The using of heuristic methods is recommended when is searched for a good solution in a timely manner.
The application of these methods provides alternatives for transporting different products in a defined time horizon and compare heuristic methods with continuous and binary encodings.
maximum coverage is np-hard, and heuristic methods are used to solve them.
addressing the supply chain design and heuristic methods.
evaluation of the proposed heuristics with the best heuristic methods reported in the literature.
Based on constructive heuristics Based on perturbative heuristics Generate new heuristic methods using basic components of previously existing heuristic methods.
other ones can also be used such as the VNS and Variable Neighborhood Descent VND heuristic methods.
through the use of heuristic methods.
evaluated sequencing rules and heuristic methods for production scheduling in permutation flow shop systems with setup times independent of the sequence of execution of tasks.
Most multiple sequence alignment programs use heuristic methods rather than global optimization because identifying the optimal alignment between more than a few sequences of moderate length is prohibitively computationally expensive.
requires the use of heuristic methods for its resolution.
when they are included, the heuristic methods are used.
using possibilistic conception of heuristic methods.
Although many practical instances of SAT can be solved by heuristic methods, the question of whether there is a deterministic polynomial-time algorithm for SAT(and consequently all other NP-complete problems)
The FASTA program follows a largely heuristic method which contributes to the high speed of its execution.
As a result, it was decided to formulating the problem as a non unicost set covering problem and to use a heuristic method to solve it.
Concerning the determination of its parameters, the theory and the computational implementation of the heuristic method known as¿shuffled frog leaping algorithm(sfla)¿have been addressed.
The key idea of this methodology is a heuristic method, called heuristic oriented racing algorithm(hora),
is a heuristic method that ensures more comprehensive exploration possibilities avoiding the tendency of sticking to local minima, but offering greater difficulty of implementation,