An economic framework for computing

The authors take a decision theoretic-approach to algorithm construction, and they view an algorithm as a formalization of a decision process. They summarize several sufficient conditions for using dynamic programming to construct optimal algorithms or decision processes. The authors interpret these conditions and their relationships to parallel and distributed processing.<
>