Dynamic programming
In mathematics, management science, economics, computer science, and bioinformatics, dynamic programming (also known as dynamic optimization) is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions – ideally, using a memory-based data structure. The next time the same subproblem occurs, instead of recomputing its solution, one simply looks up the previously computed solution, thereby saving computation time at the expense of a (hopefully) modest expenditure in storage space. (Each of the subproblem solutions is indexed in some way, typically based on the values of its input parameters, so as to facilitate its lookup.) The technique of storing solutions to subproblems ins
known for
Wikipage disambiguates
differentFrom
primaryTopic
Dynamic programming
In mathematics, management science, economics, computer science, and bioinformatics, dynamic programming (also known as dynamic optimization) is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions – ideally, using a memory-based data structure. The next time the same subproblem occurs, instead of recomputing its solution, one simply looks up the previously computed solution, thereby saving computation time at the expense of a (hopefully) modest expenditure in storage space. (Each of the subproblem solutions is indexed in some way, typically based on the values of its input parameters, so as to facilitate its lookup.) The technique of storing solutions to subproblems ins
has abstract
25بك المحتوى هنا ينقصه الاستشه ...... ة مرورية. 2 -مثال: اقتصاد امثل
@ar
Dynamische Programmierung ist ...... e der Legendre-Transformation.
@de
En informatique, la programmat ...... 'industrie étaient de ce type.
@fr
En informática, la programació ...... cretizados y secuencializados.
@es
In Informatica, la programmazi ...... zo di sottostrutture ottimali.
@it
In mathematics, management sci ...... hange problem described above.
@en
Programação dinâmica é um méto ...... o mesmo problema muitas vezes.
@pt
Programowanie dynamiczne jest ...... ące w problemie są niewielkie.
@pl
Динамическое программирование ...... ьности более простых подзадач.
@ru
动态规划(英语:Dynamic programming,简称 ...... 种做法在重复子问题的数目关于输入的规模呈指數增長时特别有用。
@zh
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
741,609,164
subject
hypernym
comment
25بك المحتوى هنا ينقصه الاستشه ...... مق أولا). 2 -مثال: اقتصاد امثل
@ar
Dynamische Programmierung ist ...... hen Programmierung gesprochen.
@de
En informatique, la programmat ...... 'industrie étaient de ce type.
@fr
En informática, la programació ...... cretizados y secuencializados.
@es
In Informatica, la programmazi ...... zo di sottostrutture ottimali.
@it
In mathematics, management sci ...... g solutions to subproblems ins
@en
Programação dinâmica é um méto ...... , compõem o problema original.
@pt
Programowanie dynamiczne jest ...... medal of honour) w 1979 roku.
@pl
Динамическое программирование ...... , можно значительно сократить.
@ru
动态规划(英语:Dynamic programming,简称 ...... 种做法在重复子问题的数目关于输入的规模呈指數增長时特别有用。
@zh
label
Dynamic programming
@en
Dynamische Programmierung
@de
Programación dinámica
@es
Programação dinâmica
@pt
Programmation dynamique
@fr
Programmazione dinamica
@it
Programowanie dynamiczne
@pl
Динамическое программирование
@ru
برمجة ديناميكية
@ar
动态规划
@zh