Practica 1 de metaheuristica
-
Updated
Oct 4, 2018 - Java
Practica 1 de metaheuristica
DSL: automatic derivation of greedy algorithm and dynamic programming
(Incremental) greedy Hypervolume Subset Selection in 2 and 3 dimensions
Perturbation based Technique for Privacy Preserving Social Network Data
Greedy solution for multiset data structures
Implemented MST (Minimum Spanning Tree) for a weighted, undirected graph using Prim’s algorithm. The program uses an 'adjacency list' and 'edge matrix' to support various commands and manipulations. These include: calculating MST value, finding the degree of a vertex, inserting/deleting edges, etc.
text compression using huffman coding
Implementation of algorithms to solve N-Puzzles in haskell
Team Veni Vidi Vsync's submission for the Google Hash Code 2017 Online Qualification Round.
Maximum independent set problem - greedy and brute force parallel algorithms
Money Management Tool for changing money, coin conversion and more.
Compression utility
Building a corpus whose unit distribution is approximately the same as a given target distribution by using a greedy algorithm with the Kullback-Leibler divergence. Can be used for Text-To-Speech synthesis application.
In this algorithm, I have written a module which is consist of a couple of main searching algorithm that has been implemented on the 8 puzzle problem as default.
Add a description, image, and links to the greedy-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the greedy-algorithm topic, visit your repo's landing page and select "manage topics."