Efficient heuristic algorithms for path-based hardware/software partitioning
From MaRDI portal
Recommendations
- Algorithmic aspects for multiple-choice hardware/software partitioning
- HW-SW partitioning based on genetic algorithms
- Finding optimal hardware/software partitions
- Algorithmic aspects for power-efficient hardware/software partitioning
- Solving hardware/software partitioning via a discrete dynamic convexized method
Cites work
- A minimal algorithm for the multiple-choice knapsack problem
- An Algorithm for Large Zero-One Knapsack Problems
- Future paths for integer programming and links to artificial intelligence
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1016767 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- Low-complex dynamic programming algorithm for hardware/software partitioning
- On the computational power of pushdown automata
- Probabilistic analysis of knapsack core algorithms
Cited in
(9)- Algorithmic aspects for power-efficient hardware/software partitioning
- Comparing three heuristic search methods for functional partitioning in hardware--software codesign
- Finding optimal hardware/software partitions
- A system level implementation strategy and partitioning heuristic for LUT-based applications
- HW-SW partitioning based on genetic algorithms
- Algorithmic aspects for multiple-choice hardware/software partitioning
- scientific article; zbMATH DE number 1844680 (Why is no real title available?)
- scientific article; zbMATH DE number 1406089 (Why is no real title available?)
- Solving hardware/software partitioning via a discrete dynamic convexized method
This page was built for publication: Efficient heuristic algorithms for path-based hardware/software partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q988463)