Übersetzung für 'solution algorithm' von Englisch nach Deutsch

solution algorithm

Lösungs­algorithmus {m}math.

---

Broyden-Fletcher-Goldfarb-Shanno algorithm <BFGS algorithm>

Broyden-Fletcher-Goldfarb-Shanno-Algorithmus {m} <BFGS-Algorithmus>comp.math.

Werbung

ant colony optimization algorithm <ACO algorithm>

Ameisenalgorithmus {m}comp.math.spec.

branch and bound algorithm <BB algorithm>

Branch-and-Bound-Algorithmus {m} <BB- / B&B-Algorithmus> [Verzweigung und Schranke]

Knuth-Morris-Pratt algorithm <KMP algorithm>

Knuth-Morris-Pratt-Algorithmus {m}comp.

Jukes-Cantor algorithm <JC algorithm>

Jukes-Cantor-Algorithmus {m}biol.

estimation-maximization algorithm <EM algorithm>

EM-Algorithmus {m}math.stat.

normal solution <N solution>

Normallösung {f}chem.tech.

algorithm

Rechenanweisung {f}math.

Rechenregel {f}

Verfahren {n}math.

Algorithmus {m}comp.math.

Nussinov algorithm

Nussinov-Algorithmus {m}biol.math.

encryption algorithm

Verschlüsselungs­algorithmus {m}comp.telecom.

sort algorithm

Sortieralgorithmus {m}comp.

combinatorial algorithm

kombinatorischer Algorithmus {m}comp.

selection algorithm

Auswahlalgorithmus {m}comp.

sorting algorithm

Sortieralgorithmus {m}comp.

Metropolis algorithm

Metropolis-Algorithmus {m}

Viterbi algorithm

Viterbi-Algorithmus {m}electr.telecom.

Horner algorithm

Horner-Schema {n}math.

• as a preconditioner in another iterative solution algorithm such as the conjugate gradient method or GMRES.
• The typical solution algorithm is a discrete raster implementation of the cost integration strategy of Warntz and Lindgren, which is a deterministic ( NP-complete) optimization.
• This latter situation leads to increased accuracy for finding the locations of objects as fewer variables are required in the inverse solution algorithm.
• Automated solution algorithm construction or logical inference is implemented at the second stage.
• Constraints can be used explicitly by the solution algorithm or can be incorporated into the objective using Lagrange multipliers.

• VPPs are iterative programs which require educated guesses of initial parameters to begin operating. Generally VPPs are composed of two mechanisms, a "boat model" and a "solution algorithm".
• Nevertheless, the solution algorithm is applicable to any size problem, with a running time of [...].
• The asymptotic complexity is defined by the most efficient (in terms of whatever computational resource one is considering) algorithm for solving the game; the most common complexity measure (computation time) is always lower-bounded by the logarithm of the asymptotic state-space complexity, since a solution algorithm must work for every possible state of the game.