Pinned Repositories
CoinDetector
CoinDetector est un projet visant à développer un modèle de détection automatique de pièces de monnaie dans des images, à évaluer les résultats du modèle de détection, ainsi qu'à classifier les résultats en utilisant des techniques de vision par ordinateur.
miniSGBD
CommunCharge
2DShortestPath
2DShortestPath is a Java project that implements and compares the Dijkstra and A* algorithms for finding the shortest path on a 2D map. It includes a weighted graph structure, methods for running the algorithms, displaying the map, and evaluating the performance of the two algorithms.
Labyrinthe
Maze Solver is a Java project that uses the A* algorithm to find a path from a start point to an exit point in a 2D maze while avoiding fire cells. It was developed as part of the advanced algorithms module at Université de Paris Cité.
Ecommerce
AkramChaabnia
Diametre_exo_2_10
Djikstra
The objective of this project is to implement Dijkstra's algorithm to find the shortest path between two nodes in a graph, considering edge weights.
SortQueueComparison
The project involves comparing the performance of Java's Quicksort and Priority Queue classes for min/max extraction. It demonstrates performance using JavaFX and Gnuplot and focuses on enhancing graphical representations in Java algorithms.
AkramChaabnia's Repositories
AkramChaabnia/AkramChaabnia
AkramChaabnia/CoinDetector
CoinDetector est un projet visant à développer un modèle de détection automatique de pièces de monnaie dans des images, à évaluer les résultats du modèle de détection, ainsi qu'à classifier les résultats en utilisant des techniques de vision par ordinateur.
AkramChaabnia/Labyrinthe
Maze Solver is a Java project that uses the A* algorithm to find a path from a start point to an exit point in a 2D maze while avoiding fire cells. It was developed as part of the advanced algorithms module at Université de Paris Cité.
AkramChaabnia/Djikstra
The objective of this project is to implement Dijkstra's algorithm to find the shortest path between two nodes in a graph, considering edge weights.
AkramChaabnia/Diametre_exo_2_10
AkramChaabnia/2DShortestPath
2DShortestPath is a Java project that implements and compares the Dijkstra and A* algorithms for finding the shortest path on a 2D map. It includes a weighted graph structure, methods for running the algorithms, displaying the map, and evaluating the performance of the two algorithms.
AkramChaabnia/SortQueueComparison
The project involves comparing the performance of Java's Quicksort and Priority Queue classes for min/max extraction. It demonstrates performance using JavaFX and Gnuplot and focuses on enhancing graphical representations in Java algorithms.
AkramChaabnia/CommunCharge
AkramChaabnia/miniSGBD