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 ...

An illustration of a magnifying glass. An illustration of a magnifying glass.

In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most of distributed and parallel graph algorithms in the MPC model are designed for static ...

This week I interviewed Senator Amy Klobuchar, Democrat of Minnesota, about her Preventing Algorithmic Collusion Act. If you don’t know what algorithmic collusion is, it’s time to get educated, ...

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 ...