Skip to content

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

Notifications You must be signed in to change notification settings

PauMayench/ia-busqueda-local-fib

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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

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

About

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

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published