Search Results - (( developing interactive case algorithm ) OR ( java implementation path algorithm ))

Search alternatives:

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
    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:
  5. 5
    An interactive analytics approach for sustainable and resilient case studies: a machine learning perspective

    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
    Save to List
    Saved in:
  6. 6
    On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing

    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
    “…Here, a set of sampled test cases is generated based on t-way covering problem (where t indicates the interaction strength). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    T-way strategy for sequence input interactions test case generation adopting fish swarm algorithm

    T-way strategy for sequence input interactions test case generation adopting fish swarm algorithm by Rahman, Mostafijur, Sultana, Dalia, Sabira, Khatun, M. F. M., Jusof, Syamimi Mardiah, Shaharum, Nurhafizah, Abu Talip Yusof, Qaiduzzaman, Khandker M., Hasan, Md. Hasibul, Rahman, Md. Mushfiqur, Hossen, Md. Anwar, Begum, Afsana

    Published 2019
    “…Since twenty years many useful t-way strategies have been developed to reduce test case size. In order to reduce test cases several T-way sequence input interaction strategies are explored, such as, Bee Algorithm(BA), Kuhn encoding (K) , ASP with Clasp , CP with Sugar, Erdem (ER) exact encoding, Tarui (TA) Method, U, UR, D and DR, Brain (BR). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    T-way testing : a test case generator based on melody search algorithm

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

    Published 2015
    “…This thesis is research on developing a T-Way Testing : A Test Case Generator Based On Melody Search Algorithm (TTT-MS) to generate optimum final test list. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  9. 9
    Whale optimization algorithm strategies for higher interaction strength t-way testing

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

    Published 2022
    “…However, the number of interaction strengths considered must be higher in the case of interactions that generate large amounts of data. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Enhancing Harmony Search Metaheuristic Algorithm for Coverage Efficiency, Test Suite Reduction, and Running Time in Combinatorial Interaction Testing

    Enhancing Harmony Search Metaheuristic Algorithm for Coverage Efficiency, Test Suite Reduction, and Running Time in Combinatorial Interaction Testing by Muazu, Aminu Aminu, Hashim, Ahmad Sobri

    Published 2025
    “…Optimization has developed powerful algorithms for solving complex problems efficiently. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation

    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
    “…This study presented the most recent variable interaction strength (VS) CT strategy using an enhanced variant in the greedy algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Integrating of web 2.0 technologies for interactive courseware : data structure and algorithm as case study

    Integrating of web 2.0 technologies for interactive courseware : data structure and algorithm as case study by Mohd Nurhafeezi, Nordin

    Published 2013
    Get full text
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  13. 13
    Applying case reuse and Rule-Based Reasoning (RBR) in object-oriented application framework documentation: Analysis and design

    Applying case reuse and Rule-Based Reasoning (RBR) in object-oriented application framework documentation: Analysis and design by Jani H.M., Lee S.P.

    Published 2023
    Subjects: “…Case reuse…”
    Conference Paper
    Save to List
    Saved in:
  14. 14
    CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm

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

    Published 2019
    “…The result of applying Jaya algorithm in input-output based combinatorial testing is acceptable since it produces nearly optimum number of test cases in the satisfactory time range.…”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  15. 15
    PSAT : a pairwise test data generation tool based on simulated annealing algorithm

    PSAT : a pairwise test data generation tool based on simulated annealing algorithm by Goh, Ghee Hau

    Published 2015
    “…In this research, the test case will be generated based on the SA algorithm to show that the test case can be generated with sufficient.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  16. 16
    Implementing a t-way test generation strategy using bees algorithm

    Implementing a t-way test generation strategy using bees algorithm by Zabil M.H.M., Zamli K.Z.

    Published 2023
    “…Highly customizable software allow users to configure the software to the users' needs, however, if not tested adequately, these software are prone to interaction faults. This paper discusses our experiences on implementation of Bees algorithm for generating test cases to detect t-way interaction faults (where t signifies the interaction strength). © SCRG Publication, 2013.…”
    Article
    Save to List
    Saved in:
  17. 17
    Implementing a T-Way Test Generation Strategy Using Bees Algorithm

    Implementing a T-Way Test Generation Strategy Using Bees Algorithm by Mohd Hazli, Mohamed Zabil, Kamal Z., Zamli

    Published 2013
    “…Highly customizable software allow users to configure the software to the users’ needs, however, if not tested adequately, these software are prone to interaction faults. This paper discusses our experiences on implementation of Bees algorithm for generating test cases to detect t-way interaction faults (where t signifies the interaction strength). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm

    CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm by Alsewari, Abdulrahman A., Ng, Yeong Khang, Kamal Z., Zamli, Mohammed E., Younis

    Published 2019
    “…The result of applying the Jaya algorithm in input-output based combinatorial testing is acceptable since it produces a nearly optimum number of test cases in a satisfactory time range.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    TBat: A Novel Strategy for Minimization of T-Way Interaction Test Suite Based on the Particle Swarm Optimization and the Bat Algorithm

    TBat: A Novel Strategy for Minimization of T-Way Interaction Test Suite Based on the Particle Swarm Optimization and the Bat Algorithm by Kamal Z., Zamli, Alsariera, Yazan A.

    Published 2016
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    A variable combinatorial test suite strategy based on modified greedy algorithm

    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
    Save to List
    Saved in:

Search Tools: