Search Results - (( java implementation path algorithm ) OR ( using interactive graph 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

    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

    Published 2012
    “…A tool termed as VIGA-20 (Visualization of Genetic Algorithm using 2-0 Graph) is implemented to accomplish this goal. …”
    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

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

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

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Soo See, Chai, Luong Goh, Kok, Weng Ng, Giap, Muzaffar, Hamzah

    Published 2022
    “…The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Goh, Kok Luong, Ng, Giap Weng, Muzaffar Hamzah, Chai, Soo See

    Published 2022
    “…The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    Collective interaction filtering with graph-based descriptors for crowd behaviour analysis by Wong, Pei Voon

    Published 2018
    “…The group detection experiment is implemented using the clustering algorithm. Normalized Mutual Information and Rand Index are used to measure the performance of Collective Interaction Filtering. …”
    Get full text
    Get full text
    Thesis
  10. 10

    A Multidimensional Search Space Using Interactive Genetic Algorithm by Farooq, H., Zakaria, M.N., Hassan, M.F., Sulaiman, Suziah

    Published 2010
    “…This paper applied an Interactive Genetic Algorithm (IGA) technique to design an visualization environment for search space. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Static and dynamic graphs modeling of a boiler system / Noor Ainy Harish by Harish, Noor Ainy

    Published 2015
    “…However, the graph of FSSM is found to be a static graph where not much analysis of the graph could explain the model of FSSM of a boiler. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    A comparative study of interactive segmentation with different number of strokes on complex images by Kok, Luong Goh, Giap, Weng Ng, Muzaffar Hamzah, Soo, See Chai

    Published 2020
    “…The most common user input type in interactive segmentation is using strokes. The different number of strokes are utilized in each different interactive segmentation algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    A Comparative Study of Interactive Segmentation with Different Number of Strokes on Complex Images by Goh, Kok Luong, Ng, Giap Weng, Muzaffar, Hamzah, Chai, Soo See

    Published 2020
    “…The most common user input type in interactive segmentation is using strokes. The different number of strokes are utilized in each different interactive segmentation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Sequence t-way test generation using the barnacles mating optimizer algorithm by Kamal Z., Zamli, Kader, Md. Abdul

    Published 2021
    “…More precisely, we focus on the generation of test cases due to the ordering of inputs (or sequence) using the newly developed Barnacles Mating Optimizer (BMO) Algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    A maximal-clique-based clustering approach for multi-observer multi-view data by using k-nearest neighbor with S-pseudo-ultrametric induced by a fuzzy similarity by Khameneh, Azadeh Zahedi, Ghaznavi, Mehrdad, Kilicman, Adem, Mahad, Zahari, Mardani, Abbas

    Published 2024
    “…To this end, we first build a k-nearest neighbor (kNN) directed graph using the proposed S-distance, then transform it into an undirected graph based on the neighborhood information of the nodes so that the resultant graph is characterized based on nodes interactions and initial features information of the nodes. …”
    Get full text
    Get full text
    Article
  17. 17

    Fluid particle interaction of Casson-Williamson fluid with Magnetohydrodynamics (MHD) and thermal radiation / Hamizah Abd Rahim by Abd Rahim, Hamizah

    Published 2024
    “…This study utilizes tables and graphs to examine the effects of various parameters like Casson, Williamson, magnetic field, Prandtl number, radiation, and fluid-particle interaction across velocity and temperature profiles. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Dynamic force-directed graph with weighted nodes for scholar network visualization by Mohd. Aris, Khalid Al-Walid, Ramasamy, Chitra, Mohd Aris, Teh Noranis, Zolkepli, Maslina

    Published 2022
    “…The approach is realized by creating a web-based interface using D3 JavaScript algorithm that allows the visualization to focus on how data are connected to each other more accurately than the conventional lines of data seen in traditional data representation. …”
    Get full text
    Get full text
    Article
  19. 19

    Characterisation of essential proteins in proteins interaction networks by Sakhinah Abu Bakar, Javid Taheri, Albert Y Zomaya

    Published 2013
    “…The proposed method, namely EP3NN (Essential Proteins Prediction using Probabilistic Neural Network), employed a machine learning algorithm called Probabilistic Neural Network as a classifier to identify essential proteins of the organism of interest. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20