Search Results - (( java simulation optimization algorithm ) OR ( using iterative generation algorithm ))

Refine Results
  1. 1

    Repetitive mutations in genetic algorithm for software test data generations by Kadhim, Mohammed Majid

    Published 2022
    “…First, the limitations of existing mutation techniques used in GA to generate test data for path coverage testing were analysed. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    VLSI floor planning optimization using genetic algorithm and cross entropy method / Angeline Teoh Szu Fern by Angeline Teoh, Szu Fern

    Published 2012
    “…This method is used to reduce the stochastic of data generation as the second iteration will have influence of the first iteration data. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Algorithm solution for space-fractional diffusion equations by Agus Sunarto, Jumat Sulaiman

    Published 2020
    “…To derive this approximation equation, the Caputo's space-fractional derivative has been used to discretize the proposed problems. By using the Caputo's finite difference approximation equation, a linear system will be generated and solved iteratively. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5
  6. 6

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  8. 8

    Computer-generated fractals with medical application in trabecular bone structure / Hizmawati Madzin by Hizmawati , Madzin

    Published 2006
    “…There are two main aims of this research, one of which is to develop a prototype known as Fractal Generation System (FGS) whereby each type of fractal is generated by practical implementations of the theories with some adaptation in the following algorithms: IFS Iteration, Formula Iteration and Generator Iteration. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Multiple equations model selection algorithm with iterative estimation method by Kamarudin, Nur Azulia, Ismail, Suzilah

    Published 2016
    “…There have been various procedures suggested to date, whether through manual or automated selections, to choose the best model.This study nonetheless focuses on an automated selection for multiple equations model with the use of iterative estimation method. In particular, an algorithm on model selection for seemingly unrelated regression equations model using iterative feasible generalized least squares estimation method is proposed. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group by Azali Saudi, Jumat Sulaiman

    Published 2014
    “…Consequently, the gradient of the potential functions would be used by the searching algorithm to generate path from starting to goal location. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11
  12. 12

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…The LP’s application is need to be further computed with a technique and Simplex algorithm is the one that commonly used. The Simplex algorithm has three stages of computation namely initialization, iterative calculation and termination. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    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
    “…The VS-MGS’s results ultimately revealed that the adaptation of elitism mechanism with iteration in greedy algorithm resulted in an improved efficiency in the process of generating a near-optimal test case set size.…”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Effect of parameters variation on the performance of particle swarm optimization algorithm for tag coverage problem of radio frequency identification network by Nawawi, Azli, Hasnan, Khalid, Ngali, Zamani, Sidek, Noor Azizah

    Published 2016
    “…From the literature, optimal tag coverage can be considered as a high dimensional optimization problem and often solved using nature-inspired algorithms. In this paper, PSO (Particle Swarm Optimization) algorithm is used to optimize the tag coverage problem. …”
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Max-D clustering K-means algorithm for Autogeneration of Centroids and Distance of Data Points Cluster by Wan Maseri, Wan Mohd, Beg, Abul Hashem, Tutut, Herawan, K., F.Rabbi

    “…The results from the new algorithm show that the number of iteration improves tremendously, and the number of iterations is reduced. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    Flower pollination algorithm for data generation and analytics - a diagnostic analysis by Odili, Julius Beneoluchi, Noraziah, Ahmad, Babalola, Asegunloluwa Eunice

    Published 2020
    “…After a number of empirical evaluations, the study finds out that the Flower Pollination Algorithm is not only a fast technique but also obtained good results when the appropriate iteration and flower population is used.…”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    Robot path planning using family of SOR iterative methods with laplacian behaviour-based control by Azali Saudi

    Published 2015
    “…This study proposed a robot path planning technique that relies on the use of Laplace's equation to constrain the generation of potential values. …”
    Get full text
    Get full text
    Get full text
    Thesis