Search Results - (( java implementation path algorithm ) OR ( based permutation parallel algorithm ))

A permutation parallel algorithm under exchange restriction with message passing interface by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

“…Permutations. However permutation generation is time consuming process, the implementation of sequential algorithm to parallel computation is the option for reducing the computation time. …”
Get full text
Get full text

Parallel strategy for starter sets to list all permutation based on cycling restriction by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar

“…permutations.The sequential algorithm is developed and parallelized for parallel computing by integrating with Message Passing Interface (MPI) libraries. …”
Get full text
Get full text
Get full text

The division free parallel algorithm for finding determinant by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

“…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
Get full text
Get full text
Get full text

New Sequential and Parallel Division Free Methods for Determinant of Matrices by Sharmila, Karim

“…The research also aims to generalise the Sarrus Rule for any order of square matrices based on permutations which are derived using starter sets. …”
Get full text
Get full text
Get full text

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

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

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

Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

“…Finally Four Heuristic and Difference Increasing and Decreasing routing algorithms based on bitwise operation are established. …”
Get full text
Get full text

Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks by Moudi, Mehrnaz

Get full text
Get full text

Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

“…The experiments conducted have proven that the proposed algorithms are effective and efficient. They are based on routing algorithms to minimize the number of passes to route all the inputs to outputs without crosstalk. …”
Get full text
Get full text

A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem by Kelvin, Lim Ching Wei

“…Given a wide range of MAR-JSR permutations, selecting a suitable MAR-JSR pair for a FJSP becomes a challenge. …”
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