Search Results - (( based application ((a algorithm) OR (new algorithm)) ) OR ( its selection based algorithm ))

Refine Results
  1. 1

    Adaptive differential evolution algorithm with fitness based selection of parameters and mutation strategies / Rawaa Dawoud Hassan Al-Dabbagh by Rawaa Dawoud Hassan, Al-Dabbagh

    Published 2015
    “…The performance of DE algorithm depends heavily on the selected mutation strategy and its associated control parameters. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
    Get full text
    Get full text
    Article
  3. 3

    Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection by Tubishat, Mohammad, Idris, Norisma, Shuib, Liyana, Abushariah, Mohammad A.M., Mirjalili, Seyedali

    Published 2020
    “…The second improvement includes the development and use of new Local Search Algorithm with SSA to improve its exploitation. …”
    Get full text
    Get full text
    Article
  4. 4

    Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

    Published 2004
    “…These two adaptive routing algorithms enhance the existing Confidence-based Q (CQ) and Confidence-based Dual Reinforcement Q (CDRQ) Routing Algorithms. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Dynamic probability selection for flower pollination algorithm based on metropolis-hastings criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Selective chaotic maps Tiki-Taka algorithm for the S-box generation and optimization by Kamal Z., Zamli, Abdul Kader, ., Fakhrud Din, ., Alhadawi, Hussam S.

    Published 2021
    “…This paper introduces a new variant of a metaheuristic algorithm based on Tiki-Taka algorithm, called selective chaotic maps Tiki-Taka algorithm (SCMTTA). …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    A novel clustering algorithm for mobile ad hoc networks based on determination of virtual links’ weight to increase network stability by Karimi, Abbas, Afsharfarnia, Abbas, Zarafshan, Faraneh, Syed Mohamed, Syed Abdul Rahman Al-Haddad

    Published 2014
    “…Thus, they decrease the weight accuracy in determining node’s competency and lead to incorrect selection of cluster heads. A new weight-based algorithm presented in this paper not only determines node’s weight using its own features, but also considers the direct effect of feature of adjacent nodes. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Improving explicit aspects extraction in sentiment analysis using optimized ruleset / Mohammad Ahmad Jomah Tubishat by Mohammad Ahmad, Jomah Tubishat

    Published 2019
    “…In addition, extraction rules including either pattern-based or dependency-based rules should be selected in a correct way to remove the irrelevant rules and minimize the extraction errors Thus, in this study, to select the most effective extraction rules, an improved version of Whale Optimization Algorithm (IWOA) is developed and applied to a full set of rules. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

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

    Published 2012
    “…EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form. …”
    Get full text
    Get full text
    Get full text
    Monograph
  10. 10

    Enhanced Q-Learning algorithm for potential actions selection in automated graphical user interface testing by Goh, Kwang Yi

    Published 2023
    “…Furthermore, the proposed techniques based on the QLearning algorithm do not consider context-based actions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Improving the exploration strategy of an automated android GUI testing tool based on the Q-Learning algorithm by selecting potential actions by Goh, Kwang Yi, Baharom, Salmi, Din, Jamilah

    Published 2022
    “…We utilise the Q-Learning algorithm to compare actions, including context-based actions, to effectively detect crashes and achieve a higher code coverage.…”
    Get full text
    Get full text
    Article
  12. 12

    MGR: An Information Theory Based Hierarchical Divisive Clustering Algorithm for Categorical Data by Hongwu, Qin, Ma, Xiuqin, Herawan, Tutut, Jasni, Mohamad Zain

    Published 2014
    “…This research proposes mean gain ratio (MGR), a new information theory based hierarchical divisive clustering algorithm for categorical data. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…Harris’s hawk multi-objective optimizer (HHMO) algorithm is a MOSIbased algorithm that was developed based on the reference point approach. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    HABCSm: A Hamming Based t -way Strategy based on Hybrid Artificial Bee Colony for Variable Strength Test Sets Generation by Alazzawi, A.K., Rais, H.M., Basri, S., Alsariera, Y.A., Capretz, L.F., Imam, A.A., Balogun, A.O.

    Published 2021
    “…Consequently, a new meta-heuristic based t -way strategy called Hybrid Artificial Bee Colony (HABCSm) strategy, based on merging the advantages of the Artificial Bee Colony (ABC) algorithm with the advantages of a Particle Swarm Optimization (PSO) algorithm is proposed in this paper. …”
    Get full text
    Get full text
    Article
  16. 16

    HABCSm: A Hamming Based t -way Strategy based on Hybrid Artificial Bee Colony for Variable Strength Test Sets Generation by Alazzawi, A.K., Rais, H.M., Basri, S., Alsariera, Y.A., Capretz, L.F., Imam, A.A., Balogun, A.O.

    Published 2021
    “…Consequently, a new meta-heuristic based t -way strategy called Hybrid Artificial Bee Colony (HABCSm) strategy, based on merging the advantages of the Artificial Bee Colony (ABC) algorithm with the advantages of a Particle Swarm Optimization (PSO) algorithm is proposed in this paper. …”
    Get full text
    Get full text
    Article
  17. 17

    Utilizing the roulette wheel based social network search algorithm for substitution box construction and optimization by Kamal Z., Zamli, Alhadawi, Hussam S., Fakhrud Din, .

    Published 2023
    “…This paper introduces a new variant of a recent metaheuristic algorithm based on the Social Network Search algorithm (SNS), which is called the Roulette Wheel Social Network Search algorithm (SNS). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Exploring a Q-learning-based chaotic naked mole rat algorithm for S-box construction and optimization by Kamal Zuhairi, Zamli, Din, Fakhrud, Alhadawi, Hussam S.

    Published 2023
    “…This paper introduces a new variant of the metaheuristic algorithm based on the naked mole rat (NMR) algorithm, called the Q-learning naked mole rat algorithm (QL-NMR), for substitution box construction and optimization. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS by MEHMOOD SHAH, SYED NASIR

    Published 2012
    “…The four prime aspects of this work are: firstly, a model of the grid scheduling problem for dynamic grid computing environment; secondly, development of a new web based simulator (SyedWSim), enabling the grid users to conduct a statistical analysis of grid workload traces and provides a realistic basis for experimentation in resource allocation and job scheduling algorithms on a grid; thirdly, proposal of a new grid resource allocation method of optimal computational cost using synthetic and real workload traces with respect to other allocation methods; and finally, proposal of some new job scheduling algorithms of optimal performance considering parameters like waiting time, turnaround time, response time, bounded slowdown, completion time and stretch time. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Efficient DNS based Load Balancing for Bursty Web Application Traffic by Chin, Mei Lu, Chong, Eng Tan, Mohamad Imran, Bin Bandan

    Published 2012
    “…This research proposes a new efficient load balancing algorithm which applies to the local Domain Name Service (DNS) server for web based applications and services to ease the sudden increase in demand for the services. …”
    Get full text
    Get full text
    Get full text
    Article