Efficient heuristic algorithms for path-based hardware/software partitioning

DOI10.1016/j.mcm.2009.08.029zbMath1193.90223OpenAlexW2021577156MaRDI QIDQ988463

Thambipillai Srikanthan, Jigang Wu, Ting Lei

Publication date: 26 August 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2009.08.029

zbMATH Keywords

algorithmdynamic programmingtabu searchheuristichardware/Software partitioning

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Theory of software (68N99) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Uses Software

• Knapsack
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low-complex dynamic programming algorithm for hardware/software partitioning
• A minimal algorithm for the multiple-choice knapsack problem
• Future paths for integer programming and links to artificial intelligence
• On the computational power of pushdown automata
• An Algorithm for Large Zero-One Knapsack Problems

This page was built for publication: Efficient heuristic algorithms for path-based hardware/software partitioning