MFry/AlgorithmsDataStructs
Implementations of various algorithms for practice, understanding and reference.
Developer Profile
MFry
Discovered public repositories for MFry in the GitHub catalog.
MFry/BowserBrowser
Following Udacity course cs262 (https://www.udacity.com/course/cs262) I am attempting to build a simple browser. The code hosted here is part mine, part professors Westley Weimer and his teaching aids.
MFry/HighVolumeAutomationTesting
High Volume Automation Testing (H-VAT) is a technique that generates many (potentially weak) tests in hopes of finding bugs that standard testing failed to find. It's common for such a technique to generate massive amounts of tests in hopes of finding certain bugs. This implementation attempts to gauge the correctness of audio conversions.
MFry/BoltzmanMachine
The traveling salesman problem(TSP) was computed using a modi ed version of the Boltzmann machine. By having a matrix which represents the distances between cities and having an initially randomly generated binary activation matrix. Having this matrix and a user de ned temperature, bonus and penalty we compute the delta c and the probability of acceptance. We then compare the probability of acceptance with a randomly generated number and if the number is less than the probability of acceptance we change that element in the activation matrix to the opposite. We repeat this process for every element in the activation matrix randomly and then decrease the temperature by 5 per cent. We continue doing this until the temperature falls bellow a user de ned threshold. Then we acquire our local minimum distance traveled and the activation matrix. This process is repeated 10,000 times and from this we pick our best result which is our outputted minimum.
MFry/Procedural-World-Library
This is a tool for the fast prototyping of procedurally generated worlds. It will allow our users to quickly construct simulations, games, or test new algorithms. Our library allows streamlining development of such projects.
MFry/Procedural-Trees
An implementation of the space colonization algorithm to create procedurally generated trees.
MFry/E51
Final Project for Algorithms and Data structures 2011 course