Abstract: This paper aims at comparing the serial, shared memory parallelization, and distributed memory parallelization of the dynamic programming algorithm for the Knapsack Problem. Knapsack Problem ...

Julia and Python recursion algorithm, fractal geometry and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Pythagorean Tree, Koch Snowflake, ...

Scientists in Spain have used genetic algorithms to optimize a feedforward artificial neural network for the prediction of energy generation of PV systems. Genetic algorithms use “parents” and ...

Abstract: Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack ...

This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were ...