Project for CS 170 - Algorithms at UC Berkeley
-
Updated
Dec 7, 2017 - Jupyter Notebook
Project for CS 170 - Algorithms at UC Berkeley
Extreme Learning Machine and Meta-heuristic algorithms implemented in C using threads to solve a Feature Selection problem related to the generation of Seawave Energy
Courseworks of VLSI Physical Design Automation, NTHU CS course teached by prof. Ting-Chi Wang in fall 2023
This is a multi-destination route optimization app, developed as a Final Year Project for a Computer Engineering degree, which received a grade of 10 with honors.
The objective of this practice is to solve a problem of a Distributed File System using two local search algorithms. Hill Climbing Simulated Annealing.
Implementation of Hill Climber and Simulated Annealing algorithms
Put people in the right places at working using 3 optimization algorithms (Ant Colony Optimization, Simmulated Annealing and Genetic Algorithm built from the ground up with Racket)
Solving TSP with metaheuristic and exact algorithms.
FIB-IA 2022-23 Q2 Artificial Intelligence subject
Text Set Cover Problem - Statistical and Deterministic approaches in comparison with simmulated-annealing and greedy algorithms.
Different algorithms to solve the TSP
Projects and assignments for the Artificial Intelligence course at UCM, with topics such as: Problem representation , solving and search. Heuristic search algorithms. Genetic algorithms. Recommender systems. Machine learning.
Simulación del cálculo de una ruta a de descenso por un cráter en marte con algoritmos de búsqueda local.
This repository seeks to optimize bikes distribution of a public bicycle renting service across city stations using local search algorithms like Hill Climbing and Simulated Annealing, aiming to minimize costs and efficiently meet demand. It includes tools to visualize the distribution and showcases the utility of AI in urban logistics.
Car-sharing system optimization with Local Search algorithms Hill Climbing and Simulated Annealing. Group project from the Artificial Intelligence course of my Data Science and Engineering Bachelor's Degree
A Python package to solve Countdown's number round using metaheuristics.
Projeto e implementação de um sistema para resolução do problema de alocação de horários utilizando a meta-heurística Simulated Annealing. Trabalho realizado no 5º período de Ciência da Computação do Instituto Federal de Minas Gerais(IFMG) - Campus Formiga para a Disciplina Inteligência Artificial.
Add a description, image, and links to the simmulated-annealing topic page so that developers can more easily learn about it.
To associate your repository with the simmulated-annealing topic, visit your repo's landing page and select "manage topics."