Search Results - (( java implementation path algorithm ) OR ( using starter based algorithm ))

  • Showing 1 - 16 results of 16
Refine Results
  1. 1

    Starter Set Generation Based on Factorial Numbers for Half Wing of Butterfly Representation by Karim, Sharmila, Ibrahim, Haslinda

    Published 2021
    “…Previously starter sets are generated by using their permutation under exchange-based and cycling based. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

    Published 2017
    “…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
    Thesis
  3. 3

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

    Published 2019
    “…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
    Thesis
  4. 4

    Comparison between starter sets generation method for listing all permutations by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni

    Published 2013
    “…distinct permutations is an exhaustive process.Using starter set, the process of listing the permutations becomes easy.However a problem arises when the equivalence starter sets will generate the similar permutation and needed to be discarded.Two new recursive strategies are proposed to generate starter sets without generating equivalence starter sets namely circular and exchange two elements operation.Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets.Computational advantages are presented comparing the results obtained by the new method with two other existing methods.The result indicates that the exchange two elements based strategy is faster than the circular based.Overall all new algorithms are better than existing algorithms in time execution.…”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    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

    Published 2021
    “…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
    Article
  6. 6

    New algorithm for listing all permutations by Ibrahim, Haslinda, Omar, Zurni, Mohd Rohni, Azizah

    Published 2010
    “…In this paper, a new algorithm for listing down all permutations for n elements is developed based on distinct starter sets. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

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

    Published 2009
    “…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
    Thesis
  8. 8

    Three phase induction motor coupled to DC motor in hybrid electric vehicle application by Zulkarnain, Lubis

    Published 2011
    “…An advanced electric drive controller for a high power starter-generator subsystem based on a series DC machine is presented. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

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

    Published 2013
    “…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
    Article
  11. 11

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

    Published 2013
    “…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
    Thesis
  12. 12
  13. 13
  14. 14
  15. 15

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

    Published 2019
    “…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
    Thesis
  16. 16