You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This repository contains an implementation of the Traveling Salesman Problem (TSP) solver using C++. The TSP is a classic algorithmic problem in the fields of computer science and operations research. The goal is to find the shortest possible route that visits a set of cities and returns to the origin city, visiting each city exactly once.
In this project my main objective is to have a detailed study and analysis of Hotel booking and cancellation using PowerBI, basically to find the probable reasons and solutions so that the business can be profitable.
Berzen (BRZN) NFTs: create, publish, buy, sell & exchange. A platform for individuals to have a professional experience using the being developed Berzen cryptocurrency.
Prim's Algorithm in Creating a MST program visually shows the target MST (Minimum Spanning Tree) with all steps of reaching to it, finally tells the log of selected graph edges and Adjacency matrix of the main tree.
The School Database System is a simple command-line application for managing student and lesson information. It allows you to add, update, delete, and view student and lesson records in a SQLite database.
The project implements an algorithm that finds the closest pair of points in a 2D screen using a time complexity of O(n log n). The algorithm is implemented in an iOS application using the MVC architectural pattern.
Multi-pronged, multi-stage analysis of a 3.5M-sentences science fiction corpus using optimized NLP, with NER techniques, LDA modeling and LLM integration. After final commit, will be able to run a main file to generate a visualization of results on-demand. Modularized and documented code that can easily be reused/refitted for other kinds of corpii.