haskell application for applying filters to an image

How to shoot yourself in the foot using several programming languages

Sistema de distribucion de archivos de musica

Paper Tube Cutting Stock Problem

Algorithms that aproximate the solution for the NP-Hard 2D BinPacking Problem. We implement local search first-fit, local search best-fit and Tabu search. The heuristic is first-fit using strips

Graph Coloring using implicit enumeration Brown's backtracking algorithm

an academic language project, more description will be posted soon

Graph Coloring using Greedy DSATUR and implicit enumaration