Werbung
 Übersetzung für 'greedy algorithm' von Englisch nach Deutsch
NOUN   a greedy algorithm | greedy algorithms
math.
greedy algorithm
Greedy-Algorithmus {m}
stat.
greedy algorithm
Greedy-Verfahren {n}
Teiltreffer
comp.math.
Broyden-Fletcher-Goldfarb-Shanno algorithm <BFGS algorithm>
Broyden-Fletcher-Goldfarb-Shanno-Algorithmus {m} <BFGS-Algorithmus>
branch and bound algorithm <BB algorithm> Branch-and-Bound-Algorithmus {m} <BB- / B&B-Algorithmus> [Verzweigung und Schranke]
comp.
Knuth-Morris-Pratt algorithm <KMP algorithm>
Knuth-Morris-Pratt-Algorithmus {m}
comp.math.spec.
ant colony optimization algorithm <ACO algorithm>
Ameisenalgorithmus {m}
math.stat.
estimation-maximization algorithm <EM algorithm>
EM-Algorithmus {m}
biol.
Jukes-Cantor algorithm <JC algorithm>
Jukes-Cantor-Algorithmus {m}
greedy {adj}ruchert [bayer.] [geizig, habgierig]
greedy {adj}gierig
5152
greedy {adj}habgierig
1384
greedy {adj}habsüchtig
55
greedy {adj}raffgierig
108
greedy personRuach {m} [bayer.] [österr.] [raffgierige Person]
sociol.
greedy person
Nimmersatt {m} [ugs.] [pej.] [ein unersättlicher Mensch]
to be greedyverfressen sein
greedy {adj} [gluttonous]gefräßig
206
more greedy {adj}gefräßiger
most greedy {adj}gefräßigste
to be greedygierig sein
the greedy few {pl}die gierigen Wenigen {pl}
greedy for knowledge {adj}wissbegierig
22 Übersetzungen
Neue Wörterbuch-Abfrage: Einfach jetzt tippen!

Anwendungsbeispiele Englisch
  • the procedure reduces to the greedy algorithm, which makes only the downhill transitions.
  • 7 contains a list of methods for converting an improper fraction to an Egyptian fraction, including the greedy algorithm for Egyptian fractions, also known as the Fibonacci–Sylvester expansion.
  • One practical routing algorithm is to pick the pin farthest from the center of the board, then use a greedy algorithm to select the next-nearest unrouted pin with the same signal name.
  • It is a greedy algorithm in graph theory as in each step it adds the next lowest-weight edge that will not form a cycle to the minimum spanning forest.
  • Although Goldbach's conjecture implies that every positive integer greater than one can be written as a sum of at most three primes, it is not always possible to find such a sum using a greedy algorithm that uses the largest possible prime at each step.

  • In general, a greedy algorithm is just an iterative process in which a "locally best choice", usually an input of maximum weight, is chosen each round until all available choices have been exhausted.
  • Put otherwise, we find a maximal matching "M" with a greedy algorithm and construct a vertex cover "C" that consists of all endpoints of the edges in "M".
  • The problem of finding a maximal independent set can be solved in polynomial time by a trivial greedy algorithm. All maximal independent sets can be found in time O(3"n"/3) = O(1.4423"n").
  • A straightforward distributed version of the greedy algorithm for (Δ + 1)-coloring requires Θ("n") communication rounds in the worst case − information may need to be propagated from one side of the network to another side.
  • The simplest greedy algorithm places consecutive labels on the map in positions that result in minimal overlap of labels.

  • If we start with an initial solution made with a greedy algorithm, the average number of moves greatly decreases again and is [...].
Werbung
© dict.cc English-German dictionary 2024
Enthält Übersetzungen von der TU Chemnitz sowie aus Mr Honey's Business Dictionary (nur Englisch/Deutsch).
Links auf das Wörterbuch oder auch auf einzelne Übersetzungen sind immer herzlich willkommen!