Dynamic Programming: a different perspective (1997)
| Venue: | Algorithmic Languages and Calculi |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Curtis97dynamicprogramming:,
author = {Sharon Curtis},
title = {Dynamic Programming: a different perspective},
booktitle = {Algorithmic Languages and Calculi},
year = {1997},
pages = {1--23},
publisher = {Chapman & Hall}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Dynamic programming has long been used as an algorithm design technique, with various mathematical theories proposed to model it. Here we take a different perspective, using a relational calculus to model the problems and solutions using dynamic programming. This approach serves to shed new light on the different styles of dynamic programming, representing them by different search strategies of the tree-like space of partial solutions. 1 INTRODUCTION AND HISTORY Dynamic programming is an algorithm design technique for solving many different types of optimization problem, applicable to such diverse fields as operations research (Ecker and Kupferschmid, 1988) and neutron transport theory (Bellman, Kagiwada and Kalaba, 1967). The mathematical theory of the subject dates back to 1957, when Richard Bellman (Bellman, 1957) first popularized the idea, producing a mathematical theory to model multi-stage decision processes and to solve related optimization problems. He was also the first to i...
