Search Results - (( java implementation path algorithm ) OR ( parallel optimization mining algorithm ))

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

A GPU accelerated parallel genetic algorithm for the traveling salesman problem by Binjubier, Mohammed, Mohd Arfian, Ismail, Tusher, Ekramul Haque, Aljanabi, Mohammad

Get full text
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text

Optimizing OLAP heterogeneous computing based on Rabin-Karp algorithm by Alzeini, Haytham I M, Hameed, Shihab A., Habaebi, Mohamed Hadi

“…In this paper, through experimental results and based on Rabin-Karp Algorithm; we propose an optimized heterogeneous solution that takes into account the benefits and the boundaries in order to achieve a better OLAP performance in terms of response time with three times gain. …”
Get full text
Get full text
Get full text

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text

The Parallel Fuzzy C-Median Clustering Algorithm Using Spark for the Big Data by Mallik, Moksud Alam, Zulkurnain, Nurul Fariza, Siddiqui, Sumrana, Sarkar, Rashel

“…Therefore, we develop a Parallel Fuzzy C-Median Clustering Algorithm Using Spark for Big Data that can handle large datasets while maintaining high accuracy and scalability. …”
Get full text
Get full text
Get full text
Get full text

Hybrid metaheuristics for QOS-aware service composition / Hadi Naghavipour by Hadi , Naghavipour

“…On that basis, the second contribution of this thesis is proposing a fast fuzzy evolutionary algorithm with minimal stochastic behaviour. Furthermore, this thesis contributes to the body of knowledge by introducing a novel method called Fuzzy Rough set Genetic Algorithm (FRGA) that take on efficiency of metaheuristics while reducing search space by leveraging the data mining aspect of rough set theory. …”
Get full text
Get full text
Get full text

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

“…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
Get full text
Get full text