Dynamic Programming
البرمجة الديناميكية
أسلوب أمثَلَة يفكّك المسألة إلى مسائل جزئية متداخلة ويحفظ حلّ كلٍّ منها لتجنب إعادة الحساب.
An optimization method that decomposes a problem into overlapping subproblems and stores each solution to avoid redundant computation.
Also translated asالبرمجة الحركية، التحسين المرحلي
First appears in this corpus in: Dynamic Programming (1957)
Appears in these papers
- Backpropagation Through Time: What It Does and How to Do It1990in the sky ✦
- Dynamic Programming1957in the sky ✦
- A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition1989in the sky ✦
- A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition1989in the sky ✦
- Q-Learning1992in the sky ✦
- Learning to Predict by the Methods of Temporal Differences1988in the sky ✦
- Tree of Thoughts: Deliberate Problem Solving with Large Language Models2023in the sky ✦