From the theory to the tools: parallel dynamic programming

DOI<21::AID-CPE452>3.0.CO;2-2 10.1002/(SICI)1096-9128(200001)12:1<21::AID-CPE452>3.0.CO;2-2zbMath0949.68519OpenAlexW1970747836MaRDI QIDQ4487154

C. Rodríguez, D. González, F. Almeida, J. L. Roda

Publication date: 21 June 2000

Full work available at URL: https://doi.org/10.1002/(sici)1096-9128(200001)12:1<21::aid-cpe452>3.0.co;2-2

zbMATH Keywords

dynamic programming

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites Work

• Experiments with parallel algorithms for combinatorial problems
• An improved parallel algorithm for 0/1 knapsack problem
• Dynamic programming on a shared-memory multiprocessor
• Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
• Mapping dynamic programming onto modular linear systolic arrays
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• Branch-and-Bound Strategies for Dynamic Programming
• A PARALLEL ALGORITHM FOR THE INTEGER KNAPSACK PROBLEM FOR PIPELINE NETWORKS
• Finite-State Processes and Dynamic Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: From the theory to the tools: parallel dynamic programming