Search Results - (( probable distribution process algorithm ) OR ( parameter optimization max algorithm ))*

Refine Results
  1. 1

    Reactive approach for automating exploration and exploitation in ant colony optimization by Allwawi, Rafid Sagban Abbood

    Published 2016
    “…Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…The last objective of this thesis is to optimize the parameter settings of the best performing ant algorithm with local search. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Improvement of Centralized Routing and Scheduling Using Cross-Layer Design and Multi-Slot Assignment in Wimax Mesh Networks by Al-Humairi, Ali Zuhair Abdulameer

    Published 2009
    “…This thesis proposes an optimized strategy namely cross-layer design in routing algorithms used find the best route for all SSs and scheduling algorithms, used to assign a time slot for each possible node transmission. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Prediction and multi-criteria-based schemes for seamless handover mechanism in mobile WiMAX networks by Mubarak, Mohammed Awadh Ahmed Ben

    Published 2013
    “…It reduces the number of handovers by 29.7% and 26.9%, respectively, compared to the conventional RSSI based handover algorithm and the previous worked, mobility improved handover (MIHO) algorithm. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Electric vehicle battery state of charge estimation using metaheuristic-optimized CatBoost algorithms by Mohd Herwan, Sulaiman, Zuriani, Mustaffa, Ahmad Salihin, Samsudin, Amir Izzani, Mohamed, Mohd Mawardi, Saari

    Published 2025
    “…A comprehensive data preprocessing pipeline was implemented, including missing value treatment, outlier removal, and feature normalization using Min-Max scaling. Three distinct metaheuristic algorithms were investigated: Barnacles Mating Optimizer (BMO), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Whale Optimization Algorithm (WOA), each integrated with CatBoost to optimize critical parameters including learning rate, tree depth, regularization, and bagging temperature. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7
  8. 8

    Statistical selection algorithm for peer-to-peer system by Othman, Mohamed, Kweh, Yeah Lun

    Published 2008
    “…However, this algorithm has a high probability of failure. A few improvements have been done to this original algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Design Optimization of a Gas Turbine Engine for Marine Applications: Off-Design Performance and Control System Considerations by Machmudah, A., Lemma, T.A., Solihin, M.I., Feriadi, Y., Rajabi, A., Afandi, M.I., Abbasi, A.

    Published 2022
    “…Meta-heuristic optimizations, namely a genetic algorithm (GA) and a whale optimization algorithm (WOA), are applied to optimize the designed control system. …”
    Get full text
    Get full text
    Article
  10. 10
  11. 11

    Some families of count distributions for modelling zero-inflation and dispersion / Low Yeh Ching by Low, Yeh Ching

    Published 2016
    “…A popular distribution for the modelling of discrete count data is the Poisson distribution. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…VRP in which demand at each location is unknown at the time when the route is designed but is follow a known probability distribution, is known as VRP with Stochastic Demands (VRPSD). …”
    Get full text
    Get full text
    Monograph
  14. 14

    NSGA-III algorithm for optimizing robot collaborative task allocation in the internet of things environment by Shen, jiazheng, Tang, Sai Hong, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan, Wang, Xinming

    Published 2024
    “…The experiment verified that this strategy can approach the optimal solution more closely during the population convergence process, and compared it with traditional Multi TSP algorithms and single function multi-objective Multi TSP algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    DC Motor Control using Ant Colony Optimization by Amr Mansour, Sara

    Published 2011
    “…Since 1995 various other extended versions of AS have been developed, induding Ant Colony System (ACS) and MAX-MIN Ant System (MMAS). In 1999 Dorigo proposed the Ant Colony Optimization (ACO) meta-heuristic that became the most successful and recognized algorithm based on ant behaviour [1]. …”
    Get full text
    Get full text
    Final Year Project
  16. 16

    Improvement and performance analysis on statistical selection algorithms by Kweh, Yeah Lun, Othman, Mohamed

    Published 2006
    “…However, this algorithm has a high probability of failure. A few improvements have been done to this original algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17
  18. 18

    Robust PID anti-swing control of automatic gantry crane based on Kharitonov's stability by Solihin, Mahmud Iwan, Martono, Wahyudi, Legowo, Ari, Akmeliawati, Rini

    Published 2009
    “…The proposed method employs Genetic Algorithm (GA) in min-max optimization to find the stable robust PID. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  19. 19

    Improving neural networks training using experiment design approach by Chong, Wei Kean

    Published 2005
    “…There are several methods of selecting training data from input space for neural networks which include D-optimal and Max-min design approaches. Consider a function approximation problem (Neural Network using Radial Basic Function structure) and limit the amount of training data, say (m) from N amount of possible data. …”
    Get full text
    Get full text
    Thesis
  20. 20

    An improvement on the valiantbrebner hypercube data broadcasting technique / Nasaruddin Zenon by Zenon, Nasaruddin

    Published 1990
    “…The writer tries to improve this algorithm because it is the only known algorithm for the hypercube machine that has the probability of more than i (log n) processors will simultaneously try to transmit a message through a given processor decreases exponentially with i. …”
    Get full text
    Get full text
    Article