Digital Image Processing
-
Updated
Dec 28, 2019 - Java
Digital Image Processing
Pacman diseñado con GUI minima para desarrollo de actividades de analisis de algoritmos (Dijkstra y A*)
This course teaches you how to calculate distance metrics, form and identify clusters in a dataset, implement k-means clustering from scratch and analyze clustering performance by calculating the silhouette score
O projeto foi um trabalho acadêmico de Inteligência artificial, tem como objetivo solucionar o problema 8-Puzzle. Confira o vídeo demonstrativo.
A console based packman game in C using A star algorithm.
Classification of IRIS Dataset using various distance metrics.
8-Puzzle solver implemented using search algorithms: DFS, BFS, A-Star (Manhattan and Euclidean heuristics) with GUI for user interactivity
Basically a port of the solver I worked on in the Princeton Algorithms course
This program solves the 8-puzzle game using different informed and uninformed search methods
graph search using A star search algorithm in python3
Algoritmos de busca em largura (BFS) e busca em profundidade (DFS) usando estrutura de dados de fila e pilha, respectivamente. Na branch "Manhatan-and-Euclidian-distance", temos o BFS usado para calcular a distância euclidiana e a distância de Manhattan.
This Java-based GUI program lets users generate and solve mazes. It employs the Depth-First Search (DFS) algorithm for maze generation and A* algorithm with Manhattan distance heuristic for solving. The program provides a visual representation of the maze, allowing users to visualize the process of maze creation and solving.
This repository is used for "Computer Vision and Pattern Recognition" course work.
Another implementation of the game 15 puzzle. But you can get a hint if you stuck.
Programa en ensamblador que calcula la distancia manhatan entre dos puntos + pruebas
A program to find solution of a given 24-puzzle problem for exercise by A* searching.
Various small projects covering a wide range of topics
Modelo para predecir la probabilidad de que un nuevo cliente reciba una prestación del seguro.
Implementing the kNN algorithm using python and comparing the Euclidean, Manhattan and Minkowski distances
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."