Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Optimal Substructure
CHF 42.70
Auf Lager
SKU
5FNGH7QMIFP
1 Verfügbar 
Geliefert zwischen Di., 03.02.2026 und Mi., 04.02.2026
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, a problem is said to have optimal substructure if an optimal solution can be constructed efficiently from optimal solutions to its subproblems. This property is used to determine the usefulness of dynamic programming and greedy algorithms in a problem. Typically, a greedy algorithm is used to solve a problem with optimal substructure if it can be proved by induction that this is optimal at each step (Cormen et al. pp. 381-2). Otherwise, providing the problem exhibits overlapping subproblems as well, dynamic programming is used. If there are no appropriate greedy algorithms and the problem fails to exhibit overlapping subproblems, often a lengthy but straightforward search of the solution space is the best alternative.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131309021
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Genre Technik
- Anzahl Seiten 100
- Größe H220mm x B220mm
- EAN 9786131309021
- Format Fachbuch
- Titel Optimal Substructure
- Herausgeber Betascript Publishing
Bewertungen
Schreiben Sie eine Bewertung
