dynamic programming
динамическое программирование
An optimization method by which a problem having optimal substructure is recursively…An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.
Значение
значений: 1(неисчисляемое)An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.
динами́ческое программи́рованиеdinamíčeskoje programmírovanije
Переводы
языков: 1Русский
По значениям 1
dynamic programming:
Происхождение
Coined by American mathematician Richard E. Bellman in the 1940s.Coined by American mathematician Richard E. Bellman in the 1940s.
Wiktionary, CC BY-SA 4.0 · source
Уроки к слову
уроков: 1- A1Исчисляемые и неисчисляемые существительные — Потому что оно может быть неисчисляемым