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

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

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

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

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

    Published 2015
    “…Several researchers have been addressed the combinatorial interaction testing issues by developing the various strategies based on a search-based approach or a pure-computational approach, although, these are useful, but most of them have a lack to support the variable strength interaction which is one of CIT techniques. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Sizes of Superpixels and their Effect on Interactive Segmentation by Kok, Luong Goh, Giap, Weng Ng, Muzaffar Hamzah, Soo, See Chai

    Published 2021
    “…Semi-automated segmentation, also known as interactive image segmentation, is an algorithm that extracts a region of interest (ROI) from an image based on user input. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  11. 11

    Sizes of Superpixels and their Effect on Interactive Segmentation by Goh, Kok Luong, Ng, Giap Weng, Muzaffar, Hamzah, Chai, Soo See

    Published 2021
    “…Semi-automated segmentation, also known as interactive image segmentation, is an algorithm that extracts a region of interest (ROI) from an image based on user input. …”
    Get full text
    Get full text
    Get full text
    Proceeding
  12. 12
  13. 13

    Combinatorial test suites generation strategy utilizing the whale optimization algorithm by Ali Abdullah, Hassan, Salwani, Abdullah, Kamal Zuhairi, Zamli, Rozilawati, Razali

    Published 2020
    “…The experimental results of the test-suite generation indicate that WOA produces competitive outcomes compared to some selected single-based and population-based metaheuristic algorithms.…”
    Get full text
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation by Bahomaid, Ameen A., Alsewari, Abdulrahman A., Zamli, Kamal Z., Alsariera, Yazan A.

    Published 2018
    “…In recent times, many researchers had developed the various strategies based on the search-based approach to address the combinatorial testing issues. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Tracking of dynamic arm motion estimation and interaction with fuzzy control by Badi, Haitham, Hamza, Alaa, Mohd Yunus, Mohd Amin

    Published 2016
    “…For robustly tracking the users arm position, an arm motion estimation method is designed based on the fuzzy predictive control fuzzy Mamdani algorithm theory. …”
    Get full text
    Get full text
    Article
  17. 17

    User to user topic recommendation model for student social interaction by Ahmad Subhi, Zolkafly

    Published 2025
    “…Then, a newly developed algorithm called the Social Recommendation (SAR) algorithm ranked and recommended the best topic for social interaction. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Online food ordering application using Boyer-Moore algorithm / Muhammad Zulhilmie Dzulkifli by Dzulkifli, Muhammad Zulhilmie

    Published 2021
    “…Based on the previous report, some issues arise, such as time-consumption between the staff and the customer when ordering, lack of details and inconsistency of the manual system data. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Automated bilateral negotiation with incomplete information in the e-marketplace. by Jazayeriy, Hamid

    Published 2011
    “…In addition, the well-known alternating-offers protocol is used to govern the interactions. To generate Pareto-optimal offer with one-side incomplete information, at first,an algorithm is presented to generate multi-issue offers with perfect (complete)information. …”
    Get full text
    Get full text
    Thesis