An approach to reducing the high-speed memory requirement of dynamic programming (Q2520990): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3241581 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3286740 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3292915 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5842044 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3285814 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Steepest-Ascent Method for Solving Optimum Programming Problems / rank | |||
Normal rank |
Latest revision as of 21:26, 11 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An approach to reducing the high-speed memory requirement of dynamic programming |
scientific article |
Statements
An approach to reducing the high-speed memory requirement of dynamic programming (English)
0 references
1965
0 references
numerical analysis
0 references