Search Results - (( probability function based algorithm ) OR ( parallel optimization path algorithm ))

Refine Results
  1. 1

    Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    “…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
    Get full text
    Get full text
    Article
  2. 2
  3. 3
  4. 4
  5. 5

    Tree-based contrast subspace mining method by Florence Sia Fui Sze

    Published 2020
    “…Tree-based likelihood contrast scoring function recursively partitions a subspace space in the way that query object fall in a group that has high ratio of probability of target class and probability of other class in a contrast subspace. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…However, FPA still suffers from variability of its performance as there is no one size that fits all values for pa, depending on the characteristics of the optimisation function. This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
    Get full text
    Get full text
    Article
  8. 8

    Dynamic probability selection for flower pollination algorithm based on metropolis-hastings criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…However, FPA still suffers from variability of its performance as there is no one size that fits all values for pa, depending on the characteristics of the optimization function. This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    An empirical study of density and distribution functions for ant swarm optimized rough reducts by Pratiwi, Lustiana, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah

    Published 2011
    “…To describe relative probability of different random variables, Probability Density Function (PDF) and the Cumulative Density Function (CDF) are capable to specify its own characterization of Gaussian distributions. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  10. 10
  11. 11
  12. 12

    Improved flower pollination optimization algorithm based on swap operator and dynamic switch probability selection by Iqbal, Muhammad

    Published 2023
    “…This research proposed an algorithm which is based on dynamic switch probability to control the balance between exploration and exploitation which increases its searchability. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Optimizing S-box generation based on the Adaptive Agent Heroes and Cowards Algorithm by Kamal Z., Zamli

    Published 2021
    “…The main feature of AAHC is the fact that the algorithm allows adaptive assignment of its population agents into cowards and heroes based on the exponential controlling functions. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    A Reference Based Surface Defect Segmentation Algorithm For Automatic Optical Inspection System by Wong, Ze-Hao

    Published 2020
    “…Then, the histogram distance function for each location is computed using a pseudo-probability combination of novel histogram distance functions on a clustered histogram. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Mobility management for seamless handover in carrier aggregation heterogeneous networks deployment scenario of long term evolution-advanced by Ahmed-Abdulazeez, Mariam Ovayioza

    Published 2018
    “…Secondly, a Hybrid Handover Parameters Optimization algorithm based on Enhanced Weight Performance (HHPO) is introduced to optimize, select suitable Handover Control Parameters (HCP) and to manage the conflict that may occur among self-optimization functions. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Fair bandwidth distribution marking and scheduling algorithm in network traffic classification by Al-Kharasani, Ameen Mohammed Abdulkarem

    Published 2019
    “…Second, propose an Optimized Time Sliding Window based Three Colour Marker. Finally, propose a new method of obtaining optimal parameters dropping functions for Random Early Detection (RED) algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…However, the performance of most of these algorithms tend to decline in terms of function and computational cost when dealing with robust systems. …”
    Get full text
    Get full text
    Thesis
  19. 19

    A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors by Lee, Weng Fook

    Published 2008
    “…Different adder architectures are investigated for suitability on synthesis implementation of large data bus size adder for efficient usage within the ALU. An adder algorithm using repetitive constructs in a parallel algorithm that allows for efficient and optimal synthesis for large data bus size is proposed as a suitable implementation for the adder within the ALU. …”
    Get full text
    Thesis
  20. 20

    Dynamic S-boxes and spiral permutation function on Fibonacci sequence for secure block cipher / Kamsiah Mohamed by Mohamed, Kamsiah

    Published 2022
    “…Meanwhile, the nine dynamic S-box was designed based on the key generated to improve the substitution function. …”
    Get full text
    Get full text
    Thesis