Search Results - (( evolution optimization mining algorithm ) OR ( variable generation based algorithm ))

Refine Results
  1. 1

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…The Seed Disperser Ant Algorithm (SDAA) is developed based on the evolution or expansion process of Seed Disperser Ant (Aphaenogaster senilis) colony. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Y-type Random 2-satisfiability In Discrete Hopfield Neural Network by Guo, Yueling

    Published 2024
    “…During the retrieval phase, a new activation function and Swarm Mutation were proposed to ensure the diversity of the neuron states. The proposed algorithm and mutation mechanism showed optimal performances as compared to the existing algorithms. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Multi-Objective Hybrid Algorithm For The Classification Of Imbalanced Datasets by Saeed, Sana

    Published 2019
    “…A new self-adaptive hybrid algorithm (CSCMAES) is introduced for optimization. …”
    Get full text
    Get full text
    Thesis
  4. 4

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

    Classification with degree of importance of attributes for stock market data mining by Khokhar, Rashid Hafeez, Md. Sap, Mohd. Noor

    Published 2004
    “…The experimental results show that predictive FDT algorithm can generate a relatively optimal tree without much computation effort (comprehensibility), and WFPRs have a better predictive accuracy of stock market time series data. …”
    Get full text
    Get full text
    Article
  6. 6

    Message based random variable length key encryption algorithm. by Mirvaziri, Hamid, Jumari, Kasmiran, Ismail, Mahamod, Mohd Hanapi, Zurina

    Published 2009
    “…In order to overcome analysis mentioned above a new algorithm is designed that is based on random numbers and also can defeat time and memory constraints. …”
    Get full text
    Get full text
    Article
  7. 7

    Adopting A Particle Swarm-Based Test Generator Strategy For Variable-Strength And T-Way Testing by S. Ahmed, Bestoun

    Published 2011
    “…This thesis presents the design and implementation of a new interaction test generation strategy, known as the Particle Swarm-based Test Generator (PSTG), for generating t-way and variable-strength test suites. …”
    Get full text
    Get full text
    Thesis
  8. 8

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

    A firefly algorithm based hybrid method for structural topology optimization by Gebremedhen, H.S., Woldemichael, D.E., Hashim, F.M.

    Published 2020
    “…In this paper, a firefly algorithm based hybrid algorithm through retaining global convergence of firefly algorithm and ability to generate connected topologies of optimality criteria (OC) method is proposed as an alternative method to solve stress-based topology optimization problems. …”
    Get full text
    Get full text
    Article
  10. 10
  11. 11

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

    Published 2018
    “…To generate test cases that satisfy MC/DC criterion, many researchers adopt neighborhood based meta-heuristics algorithms (including that of Simulated Annealing and Hill Climbing) as the problem itself is neighborhood based. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Maximizing power generation in variable speed micro-hydro with power point tracking by Min Keng Tan, Norafe Maximo Javinez, Kit Guan Lim, Ahmad Razani Haron, Pungut Ibrahim, Kenneth Tze Kin Teo

    Published 2022
    “…As such, this paper aims to explore and develop a feasible maximum power point tracker (MPPT) with perturb and observe (P&O) and genetic algorithm (GA) in providing optimal power generation for variable speed micro-hydro system. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  14. 14

    A new variable strength t-way strategy based on the cuckoo search algorithm by Abdullah, Nasser, Kamal Z., Zamli

    Published 2019
    “…Despite much progress, existing strategies have not sufficiently dealt with more than one interaction between input parameters (termed variable strength tway). Complementing existing works, this paper proposes a new variable strength cuckoo search algorithm, called VCS. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15
  16. 16
  17. 17
  18. 18

    Dynamic Bayesian networks and variable length genetic algorithm for designing cue-based model for dialogue act recognition by Yahya, Anwar Ali, Mahmod, Ramlan, Ramli, Abd Rahman

    Published 2010
    “…In the second stage, the developed variable length genetic algorithm is used to select different sets of lexical cues to constitute the dynamic Bayesian networks' random variables. …”
    Get full text
    Get full text
    Article
  19. 19

    Fuzzy Adaptive Tuning of a Particle Swarm Optimization Algorithm for Variable-Strength Combinatorial Test Suite Generation by Kamal Z., Zamli, Ahmed, Bestoun S., Mahmoud, Thair, Afzal, Wasif

    Published 2018
    “…The generation of variable strength test suites is a non-deterministic polynomial-time (NP) hard computational problem \cite{BestounKamalFuzzy2017}. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  20. 20