Search Results - (( java segmentation using algorithm ) OR ( _ modification method algorithm ))

Refine Results
  1. 1

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    Published 2010
    “…Finally, the algorithm found, which would solve the image segmentation problem.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…On the other hand, the traditional algorithm using template matching only obtained 83.65% recognition rate with 0.97 second processing time. …”
    Get full text
    Get full text
    Get full text
    Book
  3. 3
  4. 4

    1D Multigrid Solver For Finite Element Method by Azhar, Mohamad Amiruddin

    Published 2022
    “…Therefore, the modification of the algorithm gives a positive impact on solver efficiency.…”
    Get full text
    Get full text
    Monograph
  5. 5
  6. 6
  7. 7

    A hybrid metaheuristic algorithm for identification of continuous-time Hammerstein systems by Jui, Julakha Jahan, Mohd Ashraf, Ahmad

    Published 2021
    “…The second modification was the hybridization of Multi-Verse Optimizer with Sine Cosine Algorithm that will balance the exploration and exploitation processes and thus improve the poor searching capability. …”
    Get full text
    Get full text
    Article
  8. 8

    Detection of multiple outliners in linear regression using nonparametric methods by Adnan, Robiah

    Published 2004
    “…Method 1 is a modification of Sebert’s method where the list squares (LS) fit is replaced by the least median of squares (LMS) fit while Method 2 is a modification of Sebert’s method where the least squares (LS) fit is replaced by the least trimmed of squares (LTS) fit. …”
    Get full text
    Get full text
    Monograph
  9. 9

    The convergence properties of a new hybrid conjugate gradient parameter for unconstrained optimization models by Sulaiman, I.M, Mamat, M., Waziri, M.Y., Yakubu, U.A., Malik, M.

    Published 2021
    “…The hybrid conjugate gradient (CG) algorithms are among the efficient modifications of the conjugate gradient methods. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Convergence of interval symmetric single-step method for simultaneous inclusion of real polynomial zeros by Salim, Nur Raidah

    Published 2012
    “…We have new modification namely ISS, IZSS and IZMSS methods which are describe precisely in this thesis. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

    Published 2011
    “…We propose a novel modification to the PSO algorithm to perform rapid discrete optimization. …”
    Get full text
    Get full text
    Research Reports
  12. 12

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

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

    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
    “…Traditional laboratory systems that identify 5-hydroxymethylcytosine (5hmC) samples are expensive and time-consuming compared to other methods. 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
  15. 15
  16. 16

    A modified n-th section line search in conjugate gradient methods for solving unconstrained optimization / Muhammad Imza Fakhri Jinudin by Jinudin, Muhammad Imza Fakhri

    Published 2018
    “…Thus, it is an ideal method to employ as a line search in CG methods. This new modification that was proposed by Hayati (2015) is named as n-th section method. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18
  19. 19

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

    New Quasi-Newton Equation And Method Via Higher Order Tensor Models by Gholilou, Fahimeh Biglari

    Published 2010
    “…The new method yields a more efficient algorithm compared to the standard limited memory BFGS with simple bounds (L-BFGS-B) method in the case of solving unconstrained problems. …”
    Get full text
    Get full text
    Thesis