See dynamic programming on Wiktionary
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "Q441199",
"in": "the 1940s"
},
"expansion": "Coined by American mathematician Richard E. Bellman in the 1940s",
"name": "coinage"
}
],
"etymology_text": "Coined by American mathematician Richard E. Bellman in the 1940s.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "dynamic programming (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Armenian translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Finnish translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Russian translations",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Computer science",
"orig": "en:Computer science",
"parents": [
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"ref": "1975, Sven Danø, Nonlinear and Dynamic Programming: An Introduction, Springer Science & Business Media, →ISBN, page 73:",
"text": "The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.",
"type": "quote"
},
{
"ref": "2000, Rein Luus, “Preface”, in Iterative Dynamic Programming, CRC Press, →ISBN:",
"text": "Dynamic programming, developed by Richard Bellmann, is a powerful method for solving optimization problems. It has the attractive feature of breaking up a complex optimization problem into a number of simpler problems.",
"type": "quote"
}
],
"glosses": [
"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."
],
"id": "en-dynamic_programming-en-noun-L7eK9oXM",
"links": [
[
"mathematics",
"mathematics"
],
[
"computer science",
"computer science"
],
[
"optimization",
"optimization"
],
[
"method",
"method"
],
[
"problem",
"problem"
],
[
"optimal substructure",
"optimal substructure"
],
[
"recursively",
"recursion"
],
[
"subproblem",
"subproblem"
],
[
"global",
"global"
],
[
"optimal",
"optimal"
]
],
"raw_glosses": [
"(mathematics, computer science) 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."
],
"related": [
{
"word": "Bellman equation"
}
],
"tags": [
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
],
"translations": [
{
"code": "hy",
"lang": "Armenian",
"roman": "dinamik cragravorum",
"sense": "dynamic programming",
"word": "դինամիկ ծրագրավորում"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "dynamic programming",
"word": "dynaaminen ohjelmointi"
},
{
"code": "ru",
"lang": "Russian",
"roman": "dinamíčeskoje programmírovanije",
"sense": "dynamic programming",
"tags": [
"neuter"
],
"word": "динами́ческое программи́рование"
}
]
}
],
"word": "dynamic programming"
}
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "Q441199",
"in": "the 1940s"
},
"expansion": "Coined by American mathematician Richard E. Bellman in the 1940s",
"name": "coinage"
}
],
"etymology_text": "Coined by American mathematician Richard E. Bellman in the 1940s.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "dynamic programming (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "Bellman equation"
}
],
"senses": [
{
"categories": [
"English coinages",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms coined by Richard E. Bellman",
"English terms with quotations",
"English uncountable nouns",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with Armenian translations",
"Terms with Finnish translations",
"Terms with Russian translations",
"en:Computer science",
"en:Mathematics"
],
"examples": [
{
"ref": "1975, Sven Danø, Nonlinear and Dynamic Programming: An Introduction, Springer Science & Business Media, →ISBN, page 73:",
"text": "The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.",
"type": "quote"
},
{
"ref": "2000, Rein Luus, “Preface”, in Iterative Dynamic Programming, CRC Press, →ISBN:",
"text": "Dynamic programming, developed by Richard Bellmann, is a powerful method for solving optimization problems. It has the attractive feature of breaking up a complex optimization problem into a number of simpler problems.",
"type": "quote"
}
],
"glosses": [
"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."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"computer science",
"computer science"
],
[
"optimization",
"optimization"
],
[
"method",
"method"
],
[
"problem",
"problem"
],
[
"optimal substructure",
"optimal substructure"
],
[
"recursively",
"recursion"
],
[
"subproblem",
"subproblem"
],
[
"global",
"global"
],
[
"optimal",
"optimal"
]
],
"raw_glosses": [
"(mathematics, computer science) 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."
],
"tags": [
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"translations": [
{
"code": "hy",
"lang": "Armenian",
"roman": "dinamik cragravorum",
"sense": "dynamic programming",
"word": "դինամիկ ծրագրավորում"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "dynamic programming",
"word": "dynaaminen ohjelmointi"
},
{
"code": "ru",
"lang": "Russian",
"roman": "dinamíčeskoje programmírovanije",
"sense": "dynamic programming",
"tags": [
"neuter"
],
"word": "динами́ческое программи́рование"
}
],
"word": "dynamic programming"
}
Download raw JSONL data for dynamic programming meaning in All languages combined (3.0kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.