https://github.com/paumayench/ia-busqueda-local-fib

The objective of this project is to solve a problem of a Distributed File System using two local search algorithms. Hill Climbing Simulated Annealing
https://github.com/paumayench/ia-busqueda-local-fib

hill-climbing ia java simulated-annealing

Last synced: 5 months ago
JSON representation

The objective of this project is to solve a problem of a Distributed File System using two local search algorithms. Hill Climbing Simulated Annealing

• Host: GitHub
• URL: https://github.com/paumayench/ia-busqueda-local-fib
• Owner: PauMayench
• Created: 2024-03-05T09:48:36.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2024-06-27T17:39:54.000Z (over 1 year ago)
• Last Synced: 2024-06-27T21:05:46.560Z (over 1 year ago)
• Topics: hill-climbing, ia, java, simulated-annealing
• Language: Java
• Homepage:
• Size: 810 KB
• Stars: 1
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Practice Local Search

## Subject: Intel·ligència Artificial IA, GEI-FIB UPC Barcelona

---

Team members:

- Arnau Claramunt

- Josep Díaz

- Pau Mayench

The objective of this project is to solve a problem of a Distributed File System using two local search algorithms.

**Hill Climbing**

**Simulated Annealing**

- For a given set of reques

ts of files in one server, indicate which servers will send the file.

![Screenshot from 2024-03-07 12-07-12](https://github.com/PauMayench/ia-busqueda-local-fib/assets/95536223/e4578f5f-d629-45e8-ba59-08392beab44e)

The project is programmed in Java and uses implemented functions from AIMA jar, created by the teachers.