IEEE

Comparative Analysis of A*, Dijkstra’s, and Breadth-First Search Algorithms: Evaluating Complexity, Optimality, and Efficiency in Shortest Pathfinding

Abstract: This paper presents a comparative analysis of three widely used pathfinding algorithms: A*, Dijistra’s, and Breadth-First Search (BFS). We evaluate these algorithms based on their complexity ...
IEEE

Evaluating Memory Management and Garbage Collection Algorithms with Virtual Threads in High-Concurrency Java Applications

Abstract: Garbage collection (GC) is a critical memory management mechanism within the Java Virtual Machine (JVM) responsible for automating memory allocation and reclamation. Its performance affects ...