From the theory to the tools: parallel dynamic programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3918092 (Why is no real title available?)
- scientific article; zbMATH DE number 43583 (Why is no real title available?)
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- scientific article; zbMATH DE number 939437 (Why is no real title available?)
- A PARALLEL ALGORITHM FOR THE INTEGER KNAPSACK PROBLEM FOR PIPELINE NETWORKS
- An improved parallel algorithm for 0/1 knapsack problem
- Branch-and-Bound Strategies for Dynamic Programming
- Dynamic programming on a shared-memory multiprocessor
- Experiments with parallel algorithms for combinatorial problems
- Finite-State Processes and Dynamic Programming
- Mapping dynamic programming onto modular linear systolic arrays
- Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
Cited in
(6)- Nondeterministic dynamic programming on a parallel coprocessing system
- scientific article; zbMATH DE number 3898635 (Why is no real title available?)
- Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
- Lock-free parallel dynamic programming
- Parallel dynamic programming and automata theory.
- Efficient massively parallel methods for dynamic programming
This page was built for publication: From the theory to the tools: parallel dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487154)