Algorithmic aspects for multiple-choice hardware/software partitioning

DOI10.1016/j.cor.2012.04.013zbMath1349.90896OpenAlexW2048223618WikidataQ58210187 ScholiaQ58210187MaRDI QIDQ339684

Qiqiang Sun, Jigang Wu, Thambipillai Srikanthan

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.013

zbMATH Keywords

algorithmdynamic programmingheuristichardware/software partitioningmultiple choice

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (1)

Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low-complex dynamic programming algorithm for hardware/software partitioning
• Future paths for integer programming and links to artificial intelligence
• Comparing three heuristic search methods for functional partitioning in hardware--software codesign
• Algorithmic Aspects of Hardware/Software Partitioning: 1D Search Algorithms

This page was built for publication: Algorithmic aspects for multiple-choice hardware/software partitioning