Problema de la minimización del ancho de banda en árboles de profundidad 2 para la clase de Algoritmos y Computación (Universidad de Valladolid)
-
Updated
Jan 27, 2016
Problema de la minimización del ancho de banda en árboles de profundidad 2 para la clase de Algoritmos y Computación (Universidad de Valladolid)
Ruby framework to work with optimization algorithms.
This class will create the knapsack, the items, and implement the three strategies to it to find their different execution times.
Algorithm for efficient file distributuion across storage nodes
Fundamental Concepts of Computer Science (Draft) - by James Arvo
analyzer of selected task scheduling heuristics.
Explore different algorithms for Maximum 0-1 Knapsack
Genetic algorithm to solve np-complete maximization problems. Originally intended for fantasy sports.
A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem
A general algorithm for Chinese Postman Problem
n-Queens [Completion] problem solver implemented as multithreaded randomized non-recursive backtracking algorithm with dam-pruning
Project for CS 170 - Algorithms at UC Berkeley
SWIFT implementations of well know algorithmic problems
Add a description, image, and links to the np-complete topic page so that developers can more easily learn about it.
To associate your repository with the np-complete topic, visit your repo's landing page and select "manage topics."