Photo from wikipedia
The computation of the optimal path is one of the critical problems in graph theory. It has been utilized in various practical ranges of real worlds applications including image processing,… Click to show full abstract
The computation of the optimal path is one of the critical problems in graph theory. It has been utilized in various practical ranges of real worlds applications including image processing, file carving, classification problem, etc. Numerous techniques have been proposed in finding optimal path solutions including using Ant Colony Optimization (ACO). Thus, this paper study the improvement made by many researchers on ACO in finding optimal path solution. Finally, this paper also identifies the recent trends and explores potential future research directions in file carving.
Journal Title: Bulletin of Electrical Engineering and Informatics
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!