Search Results - (( basic optimisation system algorithm ) OR ( using application modified algorithm ))

Refine Results
  1. 1
  2. 2

    Develpoment of combinatorial optimisation for cutting tool path strategy by Alsultaney, Hazem K., Mohd Ariffin, Mohd Khairol Anuar, Baharudin, B. T. Hang Tuah, Ali, Aidy, Mustapha, Faizal

    Published 2009
    “…This work aims to optimise the tool path by simulating the removal of material in a finite element environment, which is controlled by a Genetic Algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    An experimental validation and optimisation tool path strategy for thin walled structure by Alsultaney, Hazem K., Mohd Ariffin, Mohd Khairol Anuar, Baharudin, B. T. Hang Tuah, Ali, Aidy, Mustapha, Faizal

    Published 2011
    “…This work was carried out with the aim to optimise the tool path by simulating the removal of material in a finite element environment which is controlled by a genetic algorithm (GA). …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Unit commitment in power system using multi-agent evolutionary programming incorporating priority listing optimisation technique / Muhammad Nazree Che Othman by Che Othman, Muhammad Nazree

    Published 2013
    “…The developed technique was tested on the 10 generating units test system then up to 20 generating units in a 24-hours scheduling period and the results was compared with the basic EP, Evolutionary Programming with Priority Listing (EP-PL) and Multi-agent Evolutionary Programming (MAEP) optimisation techniques. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Optimization of modified Bouc–Wen model for magnetorheological damper using modified cuckoo search algorithm by Rosmazi, Rosli, Zamri, Mohamed

    Published 2021
    “…This article presents a new modified cuckoo search algorithm with dynamic discovery probability and step-size factor for optimizing the Bouc–Wen Model in magnetorheological damper application. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    A modified π rough k-means algorithm for web page recommendation system by Zidane, Khaled Ali Othman

    Published 2018
    “…Secondly, a modified πRKM algorithm is proposed to partition the user session data. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Adaptive beamforming algorithm based on Simulated Kalman Filter by Kelvin Lazarus, Lazarus

    Published 2017
    “…Some of the metaheuristic algorithms have been modified from the original algorithms to improve the algorithms performance in adaptive beamforming application. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14

    Evaluation of structured questions using modified BLEU algorithm by Siraj, Fadzilah, Ali, Mohamed Salem

    Published 2016
    “…This paper describes and exemplifies an application of a Structured Exam Questions Test Bank and Evaluation Using Modified Bilingual Evaluation Understudy (BLEU) Algorithm, a software system developed in pursuit of robust computerized marking of free-text answers to open-ended questions.It employs the Information System Development Research Methodology with modified BLEU Algorithm and Expert System for similar words.The system was developed to facilitate in managing and administrating structured questions for client/server architecture based on intranet. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19

    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

    Published 2017
    “…In addition, two novel Jaya-based methods namely, the modified Jaya (MJaya) algorithm and quasi-oppositional modified Jaya (QOMJaya) algorithm are proposed to solve different MOOPF problems. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis