Search Results - (( java application customization algorithm ) OR ( _ modification based algorithm ))

Refine Results
  1. 1

    An analysis of the parameter modifications in varieties of harmony search algorithm by Mansor, N. F., Abal Abas, Zuraida, Abdul Rahman, Ahmad Fadzli Nizam, Shibghatullah, Abdul Samad, Safiah , Sidek

    Published 2014
    “…A Harmony Search (HS) algorithm is a population based-meta-heuristics approach that is superior in solving diversified and large scale optimization problems. …”
    Get full text
    Get full text
    Article
  2. 2

    An analysis of the parameter modifications in varieties of harmony search algorithm by Nur Farraliza, Mansor, Zuraida, Abal Abas, Ahmad Fadzli Nizam, Abdul Rahman

    Published 2014
    “…A Harmony Search (HS) algorithm is a population based-meta-heuristics approach that is superior in solving diversified and large scale optimization problems. …”
    Get full text
    Get full text
    Article
  3. 3
  4. 4

    A hybrid residue based sequential encoding mechanism with XGBoost improved ensemble model for identifying 5-hydroxymethylcytosine modifications by Uddin I., Awan H.H., Khalid M., Khan S., Akbar S., Sarker M.R., Abdolrasol M.G.M., Alghamdi T.A.H.

    Published 2025
    “…To address this challenge, the paper proposed XGB5hmC, a machine learning algorithm based on a robust gradient boosting algorithm (XGBoost), with different residue based formulation methods to identify 5hmC samples. …”
    Article
  5. 5
  6. 6

    Modified damage location indices in beam-like structure: Analytical study by Fayyadh, M.M., Razak, H.A.

    Published 2011
    “…Proposed modifications to two existing algorithms, based on mode shape, for locating of damage in a beam like structure model are presented in this paper. …”
    Get full text
    Get full text
    Article
  7. 7

    Enhanced grey wolf optimisation algorithm for feature selection in anomaly detection by Almazini, Hussein

    Published 2022
    “…The first modification enhances the initial population of the MBGWO using a heuristic based Ant Colony Optimisation algorithm. …”
    Get full text
    Get full text
    Thesis
  8. 8

    New selection algorithm for Mengubah Destini Anak Bangsa (MDAB) students / Zamali Tarmudi ... [et al.] by Tarmudi, Zamali, Saibin, Tammie Christy, Naharu, Nasrah, Ung, Ling Ling

    Published 2014
    “…Finally, our new proposed algorithm and modification of the variables can derive more precise in terms of representing the actual situation.…”
    Get full text
    Get full text
    Research Reports
  9. 9

    An improved marine predators algorithm tuned data-driven multiple-node hormone regulation neuroendocrine-PID controller for multi-input–multi-output gantry crane system by Mohd Zaidi, Mohd Tumari, Mohd Ashraf, Ahmad, Mohd Helmi, Suid, Mohd Riduwan, Ghazali, M Osman, Tokhi

    Published 2023
    “…Comparative findings alongside other existing metaheuristic-based algorithms confirmed excellence of the proposed method through its superior performance against the conventional MPA, particle swarm optimization (PSO), grey wolf optimizer (GWO), moth-flame optimization (MFO), multi-verse optimizer (MVO), sine-cosine algorithm (SCA), salp-swarm algorithm (SSA), slime mould algorithm (SMA), flow direction algorithm (FDA), and the formally published adaptive safe experimentation dynamics (ASED)-based methods.…”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Determination of a good indicator for estimated prime factor and its modification in Fermat’s Factoring Algorithm by Mohd Tahir, Rasyid Redha, Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal, Mahad, Zahari

    Published 2021
    “…The main results of mFFA1-EPF focused on three criteria: (i) the approach to select good candidates from a list of convergent continued fraction, (ii) the establishment of new potential initial values based on EPF, and (iii) the application of the above modification upon FFA. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    A new variant of black hole algorithm based on multi population and levy flight for clustering problem by Haneen Abdul Wahab, Abdul Raheem

    Published 2020
    “…In keeping with this limitation, this study proposes a new variant of BH through two different modifications on the original BH. The first modification is the integration of BH algorithm and levy flight, which result in data clustering method, namely “Levy Flight Black Hole (LBH)”. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Parameter identification of thermoelectric modules using enhanced slime mould algorithm (ESMA) by Ponnalagu, Dharswini, Mohd Ashraf, Ahmad, Jui, Julakha Jahan

    Published 2024
    “…This paper sets pioneering research which investigates the parametric identification of thermoelectric modules (TEMs) through the employment of enhanced slime mould algorithm (ESMA). The proposed method incorporates a pair of modifications to the standard slime mould algorithm (SMA). …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Enhancing obfuscation technique for protecting source code against software reverse engineering by Mahfoudh, Asma

    Published 2019
    “…The proposed technique can be enhanced in the future to protect games applications and mobile applications that are developed by java; it can improve the software development industry. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Grammar-based prosody modification for explicit control Malay language storytelling speech synthesis / Muhammad Izzad Ramli by Ramli, Muhammad Izzad

    Published 2018
    “…Using Harmonic Noise Model (HNM) as the synthesizer, the grammar-based prosody modification rules are used to produce the synthesized storytelling speech. …”
    Get full text
    Get full text
    Thesis
  15. 15

    A HOS-based blind deconvolution algorithm for the improvement of time resolution of mixed phase low SNR seismic data by A.F.M., Hani, M.S., Younis, M.F.M., Halim

    Published 2009
    “…A blind deconvolution technique using a modified higher order statistics (HOS)-based eigenvector algorithm (EVA) is presented in this paper. …”
    Get full text
    Get full text
    Get full text
    Citation Index Journal
  16. 16

    Development of a novel locomotion algorithm for snake robot by Khan, Md. Raisuddin, Billah, Md. Masum, Watanabe, Mitsuru Lukman, Shafie, Amir Akramin

    Published 2013
    “…Several locomotion for snake navigation, such as concertina or rectilinear may be suitable for narrow spaces, but is highly inefficient if the same type of locomotion is used even in open spaces resulting friction reduction which make difficulties for snake movement. A novel locomotion algorithm has been proposed based on the modification of the multi-link snake robot, the modifications include alterations to the snake segments as well elements that mimic scales on the underside of the snake body. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    Harmony annealing algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Development of optimization Alghorithm for uncertain non-linear dynamical system by Abdul Aziz, Mohd. Ismail, Yaacob, Nazeeruddin, Mohd. Said, Norfarizan, Hamzah, Nor Hazadura

    Published 2004
    “…Based on the results of these simulations, we compared the number of iterations needed by each algorithm to arrive at the optimal solution and the CPU time taken for each algorithm to execute the search. …”
    Get full text
    Get full text
    Monograph
  20. 20