Search Results - (( java implication tree algorithm ) OR ( _ implementation case algorithm ))

Refine Results
  1. 1

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…Late Acceptance Hill Climbing (LAHC) and the Great Deluge Algorithm (GDA) which are our new implementation, Simulated Annealing (SA) and Hill Climbing (HC) are re-implemented to generate test cases satisfying MC/DC criterion for comparative analysis. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Using GA and KMP algorithm to implement an approach to learning through intelligent framework documentation by Mat Jani H., Lee S.P.

    Published 2023
    “…Within the GA, nearest neighbor algorithm is used in determining the most similar recorded case that can be used in solving the new case. …”
    Conference paper
  3. 3

    A study of fluctuations in genetic algorithm optimized network in data centre by Nurika, O., Hassan, M.F., Zakaria, N., Jung, L.T.

    Published 2017
    “…The reliability of genetic algorithm may vary based on implementation case, hence it is necessary to investigate its performance pattern for each implementation case. …”
    Get full text
    Get full text
    Article
  4. 4

    A study of fluctuations and confidence of implementation in genetic algorithm optimized network in data centre by Nurika, O., Hassan, M.F., Zakaria, N., Jung, L.T.

    Published 2018
    “…The reliability of genetic algorithm may vary based on implementation case, hence it is necessary to investigate its performance pattern for each implementation case. …”
    Get full text
    Get full text
    Article
  5. 5

    A study of fluctuations and confidence of implementation in genetic algorithm optimized network in data centre by Nurika, O., Hassan, M.F., Zakaria, N., Jung, L.T.

    Published 2018
    “…The reliability of genetic algorithm may vary based on implementation case, hence it is necessary to investigate its performance pattern for each implementation case. …”
    Get full text
    Get full text
    Article
  6. 6

    PID control system implementation in embedded system for DC motor speed control by Ariff, Che Mohd Noor

    Published 2008
    “…The result shows that, implementation of PID algorithm in small scale MCU is possible. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  7. 7

    An improved algorithm in test case generation from UML activity diagram using activity path by Hashim, Nor Laily, Salman, Yasir D.

    Published 2011
    “…This paper proposed an improved algorithm to automatically generate test cases directly from UML activity diagram using an activity graph.This algorithm has been implemented as a prototype using UML activity diagrams as inputs to generate test cases.These generated test cases are generated automatically are compared to test cases that are generated manually in order to evaluate the algorithm’s usability and reliability.The result shows that the test cases generated by the developed test case generator program are the same as the one manually derived.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Construction of prioritized t-way test suite using Bi-objective Dragonfly Algorithm by Ahmed, Mashuk, Nasser, Abdullah B., Kamal Z., Zamli

    Published 2022
    “…We have designed and implemented a Bi-objective Dragonfly Algorithm (BDA) for prioritized t-way test suite generation, and the two objectives are test case weight and test case priority. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

    Published 2015
    “…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
    Get full text
    Get full text
    Thesis
  10. 10

    A comparative study on ant-colony algorithm and genetic algorithm for mobile robot planning. by Rajendran, Piraviendran, Othman, Muhaini

    Published 2024
    “…Results indicates that ACO outperforms GA in minimizing travel distance, establishing it as the superior routing algorithm for both case studies. Case study 1, the ACO algorithm achieved a best distance of 1036 (u) with execution time 1.67 (s), while the GA algorithm resulted in a best distance 1062 (u) with execution time 0.08 (s). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Implementing case-based reasoning approach to framework documentation by Hajar M.J., Lee S.P.

    Published 2023
    “…In CBR, reasoning is based on remembering past cases. Genetic algorithm (GA) is used in implementing the CBR's "retrieve", "reuse", and "revise" steps. …”
    Conference paper
  12. 12

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    Published 2018
    “…Also, to observe the advantages and disadvantages of these four path planning algorithms. In this case, we are splitting the project task into two parts, one of which is to implement the four algorithms on a small mobile robot, which will traverse within an indoor environment. …”
    Get full text
    Get full text
    Final Year Project
  13. 13

    Similarity distance measure and prioritization algorithm for test case prioritization in software product line testing by Abd Halim, Shahliza, Abang Jawawi, Dayang Norhayati, Sahak, Muhammad

    Published 2019
    “…Identified enhancements have been implemented to both techniques for a better adoption of prioritizing SPL test cases. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Manufacturing process planning optimisation in reconfigurable multiple parts flow lines by Ismail, Napsiah, Musharavati, Farayi, Hamouda, Abdel Magid Salem, Ramli, Abdul Rahman

    Published 2008
    “…Design/methodology/approach: The genetic algorithm methodology implements a genetic algorithm that is augmented by application specific heuristics in order to guide the search for an optimal solution. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Development of symbolic algorithms for certain algebraic processes by Abd. Rahman, Ali, Aris, Nor'Aini

    Published 2007
    “…In the case of dense Legendre basis polynomials with a big GCD solution, the modular algorithm is significantly superior to the nonmodular algorithms in higher degree polynomials. …”
    Get full text
    Get full text
    Get full text
    Monograph
  17. 17

    Development of symbolic algorithms for certain algebraic processes by Abd. Rahman, Ali, Aris, Nor'aini

    Published 2007
    “…In the case of dense Legendre basis polynomials with a big GCD solution, the modular algorithm is significantly superior to the nonmodular algorithms in higher degree polynomials. …”
    Get full text
    Get full text
    Get full text
    Monograph
  18. 18

    Comparative Analysis of Neighborhood based Meta-heuristic Algorithms for MC/DC Test Data Generation by Ariful, Haque, Kamal Z., Zamli

    Published 2016
    “…In order to help test engineers to make informed decision on the best neighborhood based implementations, this paper investigates the size and time performance of two MC/DC test strategies re-implementation based on Simulated Annealing against two newly developed strategies based on Great Deluge and Late Acceptance Hill Climbing algorithms respectively. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Optimal location and size estimation of distributed generators by employing grouping particle swarm optimization and grouping genetic algorithm by Mohammed, Zahraa Abdulkareem

    Published 2017
    “…These two algorithms are compared to their original artificial intelligence algorithms, i.e. particle swarm optimization algorithm and genetic algorithm. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…This thesis describes the implementations of new parallel and sequential algorithms for electromagnetic wave propagation from a monopole antenna. …”
    Get full text
    Get full text
    Thesis