Algorithmic aspects for power-efficient hardware/software partitioning

DOI10.1016/j.matcom.2007.09.003zbMath1178.68120OpenAlexW1971990575MaRDI QIDQ1010046

Jigang Wu, Thambipillai Srikanthan, Chengbin Yan

Publication date: 3 April 2009

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2007.09.003

zbMATH Keywords

complexityalgorithmdynamic programmingheuristichardware/software partitioning

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer system organization (68M99)

Uses Software

• Knapsack

Cites Work

• A minimal algorithm for the multiple-choice knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• Improved results on the 0--1 multidimensional knapsack problem
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• Computational Science - ICCS 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic aspects for power-efficient hardware/software partitioning