Search Results - (( using optimization method algorithm ) OR ( basic computer modified algorithm ))

Refine Results
  1. 1

    Memoryless modified symmetric rank-one method for large-scale unconstrained optimization by Modarres, Farzin, Abu Hassan, Malik, Leong, Wah June

    Published 2009
    “…Computational results, for a test set consisting of 73 unconstrained optimization problems, show that the proposed algorithm is very encouraging. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    System identification using Extended Kalman Filter by Alias, Ahmad Hafizi

    Published 2017
    “…In order to evaluate the performance of the EKF learning algorithm, the proposed algorithm validation were analyzed using model validation methods as a checker such as One Step Ahead (OSA) and correlation coefficient (R2). …”
    Get full text
    Get full text
    Student Project
  3. 3

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Hybrid artificial bee colony algorithm with branch and bound for two–sided assembly line balancing by Elteriki, Salem Abdulsalam

    Published 2018
    “…Recently, the artificial bee colony (ABC) algorithm was used in the solution process where it was considered as a very useful, effective and well-known algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Power System State Estimation In Large-Scale Networks by NURSYARIZAL MOHD NOR, NURSYARIZAL

    Published 2010
    “…The gain and the Jacobian matrices associated with the basic algorithm require large storage and have to be evaluated at every iteration, resulting in more computation time. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Parametric modelling of a TRMS using dynamic spread factor particle swarm optimisation by Toha, Siti Fauziah, Abd Latiff, I., Mohamad, M., Tokhi, M Osman

    Published 2009
    “…The proposed method formulates a modified inertia weight algorithm by using a dynamic spread factor (SF). …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  7. 7

    Robust correlation feature selection based support vector machine approach for high dimensional datasets by Baba, Ishaq Abdullahi, Mohammed, Mohammed Bappah, Jillahi, Kamal Bakari, Umar, Aliyu, Hendi, Hasan Talib

    Published 2025
    “…Our method consists of three basic steps. In the first step, a weights-based modified reweighted fast, consistent, and high break-down point is computed. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9
  10. 10

    Development of computer aided three-dimensional geometric modeler based on designer's idea in twodimensional by Haron, Habibollah

    Published 2006
    “…This study has proposed better solutions in terms of an enhanced thinning algorithm, a modified Freeman chain code and Vertex chain code algorithm as picture description language, and a new computational algorithm and neural network classifier for corner detection. …”
    Get full text
    Get full text
    Monograph
  11. 11
  12. 12

    Enhanced algorithms for three-dimensional object interpreter by Haron, Habibollah

    Published 2004
    “…Besides reducing the number of image regularities used and new method to solve the linear system, this study has proposed better solutions in terms of an enhanced thinning algorithm, a modified Freeman chain code algorithm as picture description language, and a new computational comer detection algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Block matching algorithms for motion estimation using modified Cross-Diamond-Hexagonal search / Abd Razak Mahmud by Mahmud, Abd Razak

    Published 2008
    “…Step search (4SS), Diamond search (DS), Adaptive Rood Pattern Search (ARPS) and Cross-Diamond-Hexagonal search (CDHS). This algorithm basically employs two crossshaped search patterns consecutively in the very beginning steps and switch using diamond-shaped patterns. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…We demonstrate our framework; the integration of enhanced Jump Point Search algorithm with modified Bresenham for heuristic computation in virtual grid-based environment. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    A modified reweighted fast consistent and high-breakdown estimator for high-dimensional datasets by A. Baba, Ishaq, Midi, Habshah, June, Leong W., Ibragimov, Gafurjan

    Published 2024
    “…The basic idea of our proposed method is to modify the Mahalanobis distance so that it uses only the diagonal elements of the scatter matrix in the computation of the RFCH algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19
  20. 20

    Application of genetic algorithm methods to optimize flowshop sequencing problem by Mohd Fadil, Md Sairi

    Published 2008
    “…Genetic algorithm method was one of the methods that were widely used in solving optimization problem. …”
    Get full text
    Get full text
    Undergraduates Project Papers