A Logistic model for predicting divorce rates among couples, implemented using the sklearn library.

Test for comparing sorting algorithms in terms of comparisons, swaps and execution time for the Scientific Methodology subject of Computer Science at Univasf.

An interactive web application for visualizing CPU and Disk scheduling algorithms. This educational tool helps users understand how different scheduling algorithms work through animated visualizations.

Comparative analysis of Brute-force, Horspool's, and Boyer-Moore string matching algorithms.

A performance comparison between different sorting algorithms

A benchmarking toolkit for comparing Kruskal's and Prim's minimum spanning tree algorithms across various graph configurations, with visualization tools and performance analysis reports.

A Win-Tie-Loss chart is a visual tool for comparing the performance of different algorithms or methods across multiple tasks or datasets. This type of chart summarizes how often a method "wins," "ties," or "loses" compared to other methods based on a specific performance metric.

A comprehensive comparison of 4 algorithms for solving the 0/1 Knapsack Problem: Greedy, Dynamic Programming, Branch & Bound, and Genetic Algorithm. Includes performance analysis, visualization, and dataset generation tools.

Benchmark and analysis of sorting algorithms based on input size and data variability. Includes reproducible tests, statistical runtime evaluation, and interactive visualizations.

Project from the CSE 5311 Design and Analysis of Algorithms course at UTA, offering insights into sorting algorithm efficiency and performance.

This is a research specific repository based on a foundation built from the original repo "st_david-s-beacon". I am making an effort to separate the research that has been done and will be done in the the future. The original data of the Psalms is taken from the original repository.

Delivery Truck Pallet Packing Optimization Tool Using Various Programming Approaches, Developed for the L.EIC016 - Algorithm Design Course

Data science

Project to compare list update algorithms in paid-exchanges-only model.

Page Replacement Algorithm Simulator is a Streamlit-based application that simulates and compares FIFO, LRU, and Optimal algorithms. It displays memory state changes, compares page faults, and provides insights into algorithm performance.

Path finder for a 2D space using A* Algorithm, and comparison to Dijkstra and BFS

A cellular automaton framework for simulating and benchmarking drone swarm cooperation algorithms (Reinforcement Learning, Genetic Algorithms, etc.).

Les Petits Plats is a website containing their own recipes filtered by both search bar and research tag(s). These algorithms are each developed on a separate branch, to compare their performances.

🛠 Optimize pallet packing for delivery trucks using various algorithms to enhance efficiency and reduce costs.

A computational intelligence project exploring metaheuristic algorithms for combinatorial optimization, developed for the Artificial Intelligence course at FEUP.