Examples of using General algorithm in English and their translations into Spanish
{-}
-
Colloquial
-
Official
The general algorithm of working with AutoFEM Analysis is as follows.
This problem is undecidable,i.e. there is no general algorithm for solving this problem.
General Algorithm for the Semantic Decomposition of Geo-Image.
Big-O is the primary notation use for general algorithm time complexity.
The general algorithm of working with AutoFEM Analysis is as follows.
As a basic starting point it is normally assumed that,for the purposes of analysis, the general algorithm is known; this is Shannon's Maxim"the enemy knows the system"- in its turn.
Nowadays, General Algorithms have been incorporated into free distribution programs.
The primary goal of machine learning algorithms is to develop general algorithms, taking into consideration two essential variables, that are time and space efficiency.
The general algorithm for withdrawing funds is unique, regardless of the payment system selected.
Finally, regarding the methods used,the main problem to be solved is creating a general algorithm that can recognize the entire spectrum of different voices, while disregarding nationality, gender or age.
The general algorithm is relatively simple and based on a set of ants, each making one of the possible round-trips along the cities.
In pseudocode, the general algorithm for building decision trees is:[3].
The general algorithm involves determining how many particles are within a distance of r{\displaystyle r} and r+ d r{\displaystyle r+dr} away from a particle.
Therefore, general algorithms to find eigenvectors and eigenvalues are iterative.
So, not only is there no general algorithm for testing Diophantine equations for solvability, even for this one parameter family of equations, there is no algorithm. .
This will give you a much more efficient algorithm in general.
All general eigenvalue algorithms must be iterative, and the divide-and-conquer algorithm is no different.
A variety of general optimization algorithms commonly used in computer science have also been applied to the multiple sequence alignment problem.
In general, both algorithms need to materialize an intermediate state, so they are not executed in a pipelined manner.
These algorithms can be implemented more efficiently than general divide-and-conquer algorithms; in particular, if they use tail recursion, they can be converted into simple loops.
Algorithms for trapezoid graphs should be compared with algorithms for general co-comparability graphs.