Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Meta-Heuristics Approach to Knapsack Problem in Memory Management
View through CrossRef
The Knapsack Problems are among the simplest integer programs which are NP-hard. Problems in this class are typically concerned with selecting from a set of given items, each with a specified weight and value, a subset of items whose weight sum does not exceed a prescribed capacity and whose value is maximum. The classical 0-1 Knapsack Problem arises when there is one knapsack and one item of each type. This paper considers the application of classical 0-1 knapsack problem with a single constraint to computer memory management. The goal is to achieve higher efficiency with memory management in computer systems.
This study focuses on using simulated annealing and genetic algorithm for the solution of knapsack problems in optimizing computer memory. It is shown that Simulated Annealing performs better than the Genetic Algorithm for large number of processes.
Sciencedomain International
Title: Meta-Heuristics Approach to Knapsack Problem in Memory Management
Description:
The Knapsack Problems are among the simplest integer programs which are NP-hard.
Problems in this class are typically concerned with selecting from a set of given items, each with a specified weight and value, a subset of items whose weight sum does not exceed a prescribed capacity and whose value is maximum.
The classical 0-1 Knapsack Problem arises when there is one knapsack and one item of each type.
This paper considers the application of classical 0-1 knapsack problem with a single constraint to computer memory management.
The goal is to achieve higher efficiency with memory management in computer systems.
This study focuses on using simulated annealing and genetic algorithm for the solution of knapsack problems in optimizing computer memory.
It is shown that Simulated Annealing performs better than the Genetic Algorithm for large number of processes.
.
Related Results
Droplet Distribution and Weed Control Efficacy of Unmanned Aerial Vehicle Sprayer in Wheat Crop
Droplet Distribution and Weed Control Efficacy of Unmanned Aerial Vehicle Sprayer in Wheat Crop
Herbicide application with Unmanned Aerial Vehicle (UAV) is among few breakthroughs due to drift risk and loading capacity limitations. This study explored a perspective of using U...
Approximating Multiobjective Knapsack Problems
Approximating Multiobjective Knapsack Problems
For multiobjective optimization problems, it is meaningful to compute a set of solutions covering all possible trade-offs between the different objectives. The multiobjective knaps...
Leveraging Design Heuristics for Multi-Objective Metamaterial Design Optimization
Leveraging Design Heuristics for Multi-Objective Metamaterial Design Optimization
Abstract
Design optimization of metamaterials and other complex systems often relies on the use of computationally expensive models. This makes it challenging to use...
An Improved Generalized Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem
An Improved Generalized Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem
This article describes how the 0/1 Multiple Knapsack Problem (MKP), a generalization of popular 0/1 Knapsack Problem, is NP-hard and harder than simple Knapsack Problem. Solution o...
Approximating the product knapsack problem
Approximating the product knapsack problem
AbstractWe consider the product knapsack problem, which is the variant of the classical 0-1 knapsack problem where the objective consists of maximizing the product of the profits o...
Parametric Solution for Linear Bicriteria Knapsack Models
Parametric Solution for Linear Bicriteria Knapsack Models
Linear weighing is a common approach to handle multiple criteria and the “knapsack” is a well-known combinatorial optimization problem. A knapsack problem with two linearly weighte...
Knapsack Balancing via Multiobjectivization
Knapsack Balancing via Multiobjectivization
In this paper, we address the aspect of knapsack balancing in the classic knapsack problem. Recognizing that excessive dispersion in the objective function or constraint coefficien...
Meta-Representations as Representations of Processes
Meta-Representations as Representations of Processes
In this study, we explore how the notion of meta-representations in Higher-Order Theories (HOT) of consciousness can be implemented in computational models. HOT suggests that consc...