NxM puzzle solver using graph traversal algorithms
-
Updated
Jun 4, 2021 - Java
NxM puzzle solver using graph traversal algorithms
Brute force search using a combination Java and mechanical sympathy to achieve billions of comparisons/sec..
apriltag-generator and pre-generated families
A Java console application that implemetns k-fold-cross-validation system to check the accuracy of predicted ratings compared to the actual ratings and RMSE to calculate the ideal k for our dataset.
A Java console application that implements the factionality of the knn algorithm to find the similarity between a new user's location preferences and the locations. The binary data (0,1) are the location characteristics.
Código en Java de la función Hash MD5 y la distancia de Hamming.
Here implemented Simple Neuron using Hamming distance technique.
Solving the 15-Puzzle sliding game with informed search algorithms and various heuristics.
A collection of string management utilities
This package allow use strings operations to generic sequence
Add a description, image, and links to the hamming-distance topic page so that developers can more easily learn about it.
To associate your repository with the hamming-distance topic, visit your repo's landing page and select "manage topics."