plthon Goto Github PK

ai-notebooks

This is a repository of small AI projects and notebooks in Python for academic and self-learning purposes.

data-viz-with-d3js

This is a data visualization project which uses D3.js to visualize coastal clean-up data.

human-social-distancing-detection

This project is for educational purposes only.

license-plate-recognition-using-darkflow

This project is for academic purposes only. The task is to detect car license-plate numbers using a deep learning technique.

machine-learning-image-classification

This is a Machine Learning program which classifies images.

movies-filter

This is a simple procedural Python project which is beginner-friendly. This program aims to filter movies out of list of movies stored in text file with provided sorting options.

plthon

swinburne-restaurant

This is a simple python programming exercise for beginner. This program aims to handle customer reservation.

traveling_salesman

The traveling salesman problem (TSP) is an algorithmic problem tasked with finding the shortest route between a set of points and locations that must be visited. The salesman‘s goal is to keep the distance travelled as low as possible. Focused on optimization, TSP is often used in computer science to find the most efficient route for data to travel between various nodes. Applications include identifying network or hardware optimization methods. TSP has been studied for decades and several solutions have been theorized. The simplest solution is to try all possibilities, but this is also the most time consuming and expensive method. Many solutions use heuristics, which provides probability outcomes. However, the results are approximate and not always optimal. Hence, no general method of solution is known, and the problem is known as NP-hard.

waterjugai

AI solution for Water Jug Problem.