Gholamali C. Shoja

Learn More
This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack Problem (MMKP), a variant of the classical 0–1 Knapsack Problem. We apply a transformation technique to map the multidimensional resource consumption to single dimension. Convex hulls are constructed to reduce the search space to find the near-optimal solution of the(More)
Today's operating system designers face a daunting challenge: they must design systems that can support a great diversity of applications in a secure, efficient, reliable , and effective fashion. The challenge becomes even more daunting when some of the applications and their requirements cannot even be envisioned until after the system has been deployed(More)