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

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

    Published 2012
    “…This comparison is based on the same parameters except for the interactions of the user. …”
    Get full text
    Get full text
    Thesis
  8. 8

    On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing by Kamal Z., Zamli, Alsariera, Yazan A., Nasser, Abdullah B., Alsewari, Abdulrahman A.

    Published 2015
    “…Although useful, strategies based on the aforementioned optimization algorithms are not without limitation. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

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

    A Modified ACO-based Search Algorithm for Detecting Protein Functional Module From Protein Interaction Network by Jamaludin, Sallim, Rozlina, Mohamed, Roslina, Abd Hamid

    Published 2015
    “…Various graph clustering algorithms have been applied to protein interaction networks for detecting protein functional modules. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm by Mohammed Abdullah, Abdullah Nasser

    Published 2018
    “…If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. Addressing these aforementioned issues and complementing the existing sequence based strategies such as t-SEQ, Sequence Covering Array Generator and Bee Algorithm, this thesis presents a unified strategy based on the new meta-heuristic algorithm, called the Elitist Flower Pollination Algorithm (eFPA). …”
    Get full text
    Get full text
    Thesis
  12. 12

    The development of deformable bodies collision response algorithm for interactive virtual environment by Mohd. Shuaib, Norhaida, Bade, Abdullah, Daman, Daut, Sunar, Mohd. Shahrizal

    Published 2006
    “…It is an optimization algorithm that selects small areas for deformation processing based on equilibrium state. …”
    Get full text
    Get full text
    Monograph
  13. 13

    A hybrid kidney algorithm strategy for combinatorial interaction testing problem by Ameen Ali, Mohammed Ba Homaid

    Published 2022
    “…In addition, the hybrid metaheuristic-based CIT strategies require more execution time than their own original algorithm-based strategies. …”
    Get full text
    Get full text
    Thesis
  14. 14

    An interactive analytics approach for sustainable and resilient case studies: a machine learning perspective by Mousavi, Seyed Mohsen, Sadeghi R., Kiarash, Lee, Lai Soon

    Published 2023
    “…To integrate machine learning and human interactions, this paper develops a new three-stage interactive algorithm in business analytics, called the interactive Nautilus-based algorithm, to address complex problems. …”
    Get full text
    Get full text
    Article
  15. 15

    Whale optimization algorithm strategies for higher interaction strength t-way testing by Ali Abdullah, Hassan, Salwani, Abdullah, Kamal Z., Zamli, Rozilawati, Razali

    Published 2022
    “…Due to resource restrictions and the combinatorial explosion challenge, little work has been done to produce high-order interaction strength. In this context, the Whale Optimization Algorithm (WOA) is proposed to generate high-order interaction strength. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    T-way testing : a test case generator based on melody search algorithm by Toh, Shu Yuen

    Published 2015
    “…First, Inputs will be written into a text file and TTT-MS will read the inputs which are the number of Parameters, number of values for each Parameter, Parameter Names, Parameter Values Name and the Interaction Strength (t) up to t=4. Next, TTT-MS will be executed through main algorithms to generate Parameters Interaction List, Parameter Values Interaction List, and finally generate final Test Cases based on Melody Search Algorithm. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  17. 17

    Eye makeup system using interactive genetic algorithm by Chua,, Suk Ju.

    Published 2010
    “…Interaction is required for user to determine the fitness funct ions used in Genetic Algorithm. …”
    Get full text
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  18. 18

    A variable combinatorial test suite strategy based on modified greedy algorithm by Homaid, Ameen A. Ba, Alsewari, Abdulrahman A.

    Published 2015
    “…This proposed will suggest a new CIT strategy based on a modified greedy algorithm (MGA) with addressing the supporting of variable strength interaction to generate a satisfactory test suite size.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm by Ng, Yeong Khang

    Published 2019
    “…Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
  20. 20

    Efficient prime-based method for interactive mining of frequent patterns. by Mohammad Hossein, Nadimi Shahraki, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

    Published 2011
    “…In this paper, we propose a new method based on prime number and its characteristics mainly for interactive mining of frequent patterns. …”
    Get full text
    Get full text
    Article