Dynamic Programming via Static Incrementalization
Authors:
- 1 January 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 288-305
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- A generic program for sequential decision processesLecture Notes in Computer Science, 1995
- Tupling functions with multiple recursion parameters1993
- From dynamic programming to greedy algorithms1993
- Towards an automated tupling strategy1993
- Improving recursive functions by inverting the order of evaluationScience of Computer Programming, 1992
- Formal program construction by transformations-computer-aided, intuition-guided programmingIEEE Transactions on Software Engineering, 1989
- The promotion and accumulation strategies in transformational programmingACM Transactions on Programming Languages and Systems, 1984
- Eliminating Redundant Recursive Calls.ACM Transactions on Programming Languages and Systems, 1983
- Tabulation Techniques for Recursive ProgramsACM Computing Surveys, 1980
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977