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 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.

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

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

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.).

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.

🐸 Evaluate Russian language quality in LLMs by measuring typical errors through benchmark tests with diverse datasets for improved responses.

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

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.