Heuristic algorithms for solving the budget-constrained prize collecting Steiner forest problem.

Optimal Weighted Graph Matching

Implementation of a meta-heuristic based on genetic algorithms applied to the famous Knapsack problem 0/1

It uses backtracking and heuristic algorithms to solve even the most extreme sudoku boards.

Determining the sizing of transistors using heuristic algorithms and logical effort to obtain optimal delay and power

Course project for CS271: Introduction to Artificial Intelligence at UC Irvine

Resume Shortlister is an AI application based on NLP to screen and shortlist Resumes

A heuristic approach for Minimum Dominating Set which is an NP-Complete problem and analysis of speed performance and correctness.

A generalized version of the problem

📊🔄Dive into the captivating world of AI-driven gaming, where stickers of graph algorithms 📊, a dynamic blend of Dijkstra's 🌐 and bread-first search 🔍, and a thrilling twist on the minimax algorithm come together to craft an exhilarating gameplay experience🎮. Step into the future🌌, where your every move is guided by the power of heuristic AI.

Examen - Análisis y diseño de algoritmos

Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing, Ant Colony Optimization Algorithm,Immune Algorithm, Artificial Fish Swarm Algorithm, Differential Evolution and TSP(Traveling salesman)