Search Results - (( program evaluation clustering algorithm ) OR ( java implementation path algorithm ))

Search alternatives:

  • Showing 1 - 19 results of 19
Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    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
    Save to List
    Saved in:
  2. 2
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    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
    Save to List
    Saved in:
  3. 3
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    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
    Save to List
    Saved in:
  4. 4
    Efficient genetic partitioning-around-medoid algorithm for clustering

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    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
    Save to List
    Saved in:
  6. 6
    Evaluation of data mining classification and clustering techniques for diabetes / Tuba Pala and Ali Yilmaz Camurcu

    Evaluation of data mining classification and clustering techniques for diabetes / Tuba Pala and Ali Yilmaz Camurcu by Pala, Tuba, Camurcu, Ali Yilmaz

    Published 2014
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim

    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

    Published 2012
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    A Community-Based Fault Isolation Approach for Effective Simultaneous Localization of Faults

    A Community-Based Fault Isolation Approach for Effective Simultaneous Localization of Faults by Zakari, Abubakar, Lee, Sai Peck, Targio Hashem, Ibrahim Abaker

    Published 2019
    “…During program testing, software programs may be discovered to contain multiple faults. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Enhancement Of Clustering Algorithm Using 3D Euclidean Distance To Improve Network Connectivity In Wireless Sensor Networks For Correlated Node Behaviours

    Enhancement Of Clustering Algorithm Using 3D Euclidean Distance To Improve Network Connectivity In Wireless Sensor Networks For Correlated Node Behaviours by Kalid Abdlkader Marsal Salih

    Published 2024
    “…The clustering algorithm will be compared against LEACH, EEC, R-HEED, PEGASIS, and LCA algorithms to evaluate the network performance of WSN. …”
    thesis::doctoral thesis
    Save to List
    Saved in:
  10. 10
    Framework for stream clustering of trajectories based on temporal micro clustering technique

    Framework for stream clustering of trajectories based on temporal micro clustering technique by Abdulrazzaq, Musaab Riyadh

    Published 2018
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    A cluster-based hybrid replica control protocol for high availability in data grid

    A cluster-based hybrid replica control protocol for high availability in data grid by Mabni, Zulaile

    Published 2019
    “…Another proposed algorithm is replica placement algorithm which selects and places only one replica in each cluster. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    An evaluation of Monte Carlo-based hyper-heuristic for interaction testing of industrial embedded software applications.

    An evaluation of Monte Carlo-based hyper-heuristic for interaction testing of industrial embedded software applications. by S. Ahmed, Bestoun, Enoiu, Eduard, Afzal, Wasif, Kamal Z., Zamli

    Published 2020
    “…Hyper-heuristic is a new methodology for the adaptive hybridization of meta-heuristic algorithms to derive a general algorithm for solving optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    A coverage path planning approach for autonomous radiation mapping with a mobile robot

    A coverage path planning approach for autonomous radiation mapping with a mobile robot by Abd Rahman N.A., Sahari K.S.M., Hamid N.A., Hou Y.C.

    Published 2023
    Article
    Save to List
    Saved in:
  14. 14
    An integrated model of automated elementary programming feedback using assisted and recommendation approach

    An integrated model of automated elementary programming feedback using assisted and recommendation approach by Safei, Suhailan

    Published 2017
    “…Meanwhile, similar difficulty groups of the computer programs were generated using a K-Means clustering algorithm that was enhanced with ranking consideration. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Enhancing teaching and learning through data-driven optimization of servicing code demand and lecturer allocation using WEKA analysis

    Enhancing teaching and learning through data-driven optimization of servicing code demand and lecturer allocation using WEKA analysis by Rochin Demong, Nur Atiqah, Mohamed Razali, Murni Zarina, Kamaruddin, Juliana Noor, Shamsuddin, Sazwan, Awang, Nor Ain, Kamarudin, Norjuliatie, Wan Othman, Noor Faradilla

    Published 2025
    “…Attribute selection through Information Gain Attrite Evaluation model highlighted Program Code, Course Code and Type of Course as the strongest predictors of course approval and demand levels. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs

    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
    Save to List
    Saved in:
  17. 17
    Bottleneck-based heuristic for permutation flowshop scheduling

    Bottleneck-based heuristic for permutation flowshop scheduling by Isa, Noor Amira

    Published 2017
    “…There are four potential dominant machines (M1, M2, M3, M4) clustered as bottleneck machines. A total 1000 set random processing time for each job sizes was tested using Excel simple programming with built in Visual Basic for Application (VBA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    New techniques incorporating computational intelligence based for voltage stability evaluation and improvement in power system / Nur Fadilah Ab. Aziz

    New techniques incorporating computational intelligence based for voltage stability evaluation and improvement in power system / Nur Fadilah Ab. Aziz by Ab. Aziz, Nur Fadilah

    Published 2014
    “…VSCI was used as the indicator for the MLP of load buses. Another new hybrid algorithm that used Evolutionary Programming (EP) termed as Evolutionary Support Vector Machine (ESVM) was also developed for comparative study. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Development of an integrated model for production planning and cell formation in cellular manufacturing systems

    Development of an integrated model for production planning and cell formation in cellular manufacturing systems by Raminfar, Reza

    Published 2010
    “…These examples are written with lingo codes in LINGO software. In order to evaluate and verify the performance of the proposed model, it is compared with a well-known cell formation method (Rank order clustering, ROC), using group capability index (GCI) measure. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: