Complete Java Approach
-
Updated
Apr 16, 2016 - Java
Complete Java Approach
Programa en ensamblador que calcula la distancia manhatan entre dos puntos + pruebas
A sliding puzzle game and solver using ncurses.
A program to find solution of a given 24-puzzle problem for exercise by A* searching.
Machine learning functions written in goLang:
Repository for my implementation of the Viagogo Coding Challenge
C codes for the Arificial Intelligence Course and algorithms.
A Keras Implementation of Attention_based Siamese Manhattan LSTM
A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts
The MongoDB Database with image similarity functions
App that creates a shortest distance/path of all the items you want from the store
Maze is a mini project developed to generate a maze randomly and be capable to resolve it using A* algorithm and Manhattan or Pythagore heuristics.
Implementations of the Kaggle Digit Recognizer problem in Machine Learning
C++ implementation of IDA* algorithm for solving the 15 and 25 puzzle
Basically a port of the solver I worked on in the Princeton Algorithms course
This program lists all the paths with the same Manhattan distance from the king to the chess piece.
A siamese adaptation of the Long Short-Term Memory (LSTM) network for labeled data comprised of pairs of variable-length sequences.
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.
Add a description, image, and links to the manhattan-distance topic page so that developers can more easily learn about it.
To associate your repository with the manhattan-distance topic, visit your repo's landing page and select "manage topics."