You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Implementation of a genetic algorithm to solve the Knapsack problem with a capacity C and a given set of N objects. The genetic fitness function sums up the profits of the objects in the Knapsack.
This project is inspired by the research work reported in the article Optimal Power Allocation in Server Farms . Server farms are a common part of many corporations’ computing infrastructure but they consume a lot of energy. The key question asked in this research is: Is it possible to reduce the energy consumption of server farms while maintain…