Search Results - (( java implementation path algorithm ) OR ( using groups using algorithm ))

Refine Results
  1. 1

    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
  2. 2

    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
  3. 3

    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
  4. 4

    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
  5. 5

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Jamaluddin, Hishamuddin, Abd. Samad, M. F., Ahmad, Robiah, Yaacob, M. S.

    Published 2007
    “…One of the strategies applied is the modified genetic algorithm which relies on, among other things, the separation of the population into groups where each group undergoes mutual recombination operations. …”
    Get full text
    Get full text
    Article
  6. 6

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Jamaluddin, H., Samad, M. F. A., Ahmad, R., Yaacob, M. S.

    Published 2007
    “…One of the strategies applied is the modified genetic algorithm which relies on, among other things, the separation of the population into groups where each group undergoes mutual recombination operations. …”
    Get full text
    Get full text
    Article
  7. 7

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Abd Samad, Md Fahmi

    Published 2007
    “…One of the strategies applied is the modified genetic algorithm which relies on, among other things, the separation of the population into groups where each group undergoes mutual recombination operations. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    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
  9. 9

    Optimal location and size estimation of distributed generators by employing grouping particle swarm optimization and grouping genetic algorithm by Mohammed, Zahraa Abdulkareem

    Published 2017
    “…This work is aimed to decrease the total real and reactive power losses while enhancing the voltage profile of the distribution network with less computation time by proposing two new artificial intelligence algorithms, i.e. grouping particle swarm optimization algorithm and grouping genetic algorithm. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Classification for large number of variables with two imbalanced groups by Ahmad Hakiim, Jamaluddin

    Published 2020
    “…Based on the findings, Algorithm 2 outperforms Algorithm 1 in classifying the minority group, while both proposed algorithms perform equally well in classifying the majority group. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Parallel computation of maass cusp forms using mathematica by Chan, Kar Tim

    Published 2013
    “…To facilitate the complete pullback process of this group, a point locater algorithm is developed. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Comparative analysis of K-Means and K-Medoids for clustering exam questions / Nurul Zafirah Mokhtar by Mokhtar, Nurul Zafirah

    Published 2016
    “…Determining the suitable algorithm which can bring the optimized group clusters could be an issue. …”
    Get full text
    Get full text
    Thesis
  13. 13

    LASSO-type estimations for threshold autoregressive and heteroscedastic time series models. by Muhammad Jaffri Mohd Nasir

    Published 2020
    “…Empirical studies using these univariate and multivariate models show that the BCD algorithms estimate less irrelevant thresholds compared to the approximation group LASSO algorithms of group least angle regression (GLAR). …”
    Get full text
    Get full text
    UMK Etheses
  14. 14

    A method for group formation using genetic algorithm by Che Ani, Zhamri, Yasin, Azman, Husin, Mohd Zabidin, Abdul Hamid, Zauridah

    Published 2010
    “…However, due to lack of programming skills especially in Java programming language, most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in programming.This paper presents a method for group formation using genetic algorithm, where the members for each group will be generated based on the students’ programming skill.…”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

    Published 2009
    “…However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  17. 17

    Comparison study of sorting techniques in dynamic data structure by Abbas, Zeyad Adnan

    Published 2016
    “…The sorting algorithms were classified into two groups of time complexity, O (n2) group and O(nlog2n) group. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Comparison study of sorting techniques in dynamic data structure by Abbas, Zeyad Adnan

    Published 2016
    “…The sorting algorithms were classified into two groups of time complexity, 0 (n2) group and O(nlog2 n) group. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    An optimal tasks scheduling algorithm based on QoS in cloud computing network by Alhakimi, Mohammed Ameen Mohammed Abdo

    Published 2017
    “…This study presents an optimal task scheduling algorithm by enhancing Max-Min and TS algorithm. Our proposed algorithm isolates the resources into two different groups where the first group contains the resources with maximum execution time while the second group contains the resources with minimum execution time. …”
    Get full text
    Get full text
    Thesis
  20. 20