Systolic processing for dynamic programming problems

DOI10.1007/BF01602094zbMath0637.90098OpenAlexW248980059MaRDI QIDQ1099090

Guo-jie Li, Benjamin W.-S. Wah

Publication date: 1988

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01602094

zbMATH Keywords

monadic-serial dynamic programmingoptimal path in a multistage graphsystolic processing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming
• Nonserial dynamic programming
• Solvable classes of discrete dynamic programming
• The Design of Optimal Systolic Arrays
• Dynamic Programming as Graph Searching: An Algebraic Approach
• Dynamic Programming is Optimal for Nonserial Optimization Problems
• Branch-and-Bound Strategies for Dynamic Programming
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• Optimal Sorting Algorithms for Parallel Computers
• Finite-State Processes and Dynamic Programming
• Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems

This page was built for publication: Systolic processing for dynamic programming problems