Search Results - (( using optimization method algorithm ) OR ( time equalization based algorithm ))

Refine Results
  1. 1

    A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem by Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur

    Published 2017
    “…Route generation is a traveling sales man problem (TSP) and any TSP optimization method is useful for this purpose. Fisher and Jaikumar algorithm is a well-known cluster based method which creates clusters with a geometric method partitioning the customer plane into equal angular cones where the total cones are equal to the number of vehicles. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  2. 2

    Fuzzy logic-based algorithm resource scheduling for improving the reliability of cloud computing by Zavvar, Mohammad, Rezaei, Meysam, Garavand, Shole, Ramezani, Farhad

    Published 2016
    “…In the proposed method, the waiting time is equal to 26.99 and the turnaround time is equal to 82.99. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    A comparison of watermarking image quality based on dual intermediate significant bit with genetic algorithm by Yasin, Azman, M. Zeki, Akram, Mohammed, Ghassan N.

    Published 2013
    “…In this case, when the two hidden bits are equal to the original bits, there will be no change to the other remaining bits.However, if the original value is not equal to the embedded one, the nearest pixel to the original one will be chosen as the watermarked image.The second method, GA method is used to embed two bits of watermarking data within every pixel of the original image and to find the optimal value based on the existing DISB.On the other hand, if the two embedded bits are equal to the original bits then this means the watermarked image is still the same as the original one without any changes, while in the other case GA is used in determining the minimum fitness value in which the fittest is the absolute value between the pixel and chromosome and the value of chromosome between 0-255.The results indicate that the two methods produce a high quality watermarked image, but there is a big difference in the processing time, so the DISB method is faster than the GA method.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    New global maximum power point tracking and modular voltage equalizer topology for partially shaded photovoltaic system / Immad Shams by Immad , Shams

    Published 2022
    “…In terms of controller-based, in this work, a new global maximum power point tracking (GMPPT) algorithm based on a modified butterfly optimization algorithm (MBOA) has been proposed. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Jamaluddin, Hishamuddin, Abd. Samad, M. F., Ahmad, Robiah, Yaacob, M. S.

    Published 2007
    “…The genetic algorithm approach is widely recognized as an effective and flexible optimization method for system identification. …”
    Get full text
    Get full text
    Article
  6. 6

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Jamaluddin, H., Samad, M. F. A., Ahmad, R., Yaacob, M. S.

    Published 2007
    “…he genetic algorithm approach is widely recognized as an effective and flexible optimization method for system identification. …”
    Get full text
    Get full text
    Article
  7. 7

    Network reconfiguration and control for loss reduction using genetic algorithm by Jawad, Mohamed Hassan Izzaldeen

    Published 2010
    “…The proposed solution to this problem is based on a general combinatorial optimization algorithm known as Genetic Algorithm, and the load flow equations in distribution network. …”
    Get full text
    Get full text
    Thesis
  8. 8

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

    Published 2019
    “…Second, an Optimized time sliding window packet marker (OTSWTCM) algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Abd Samad, Md Fahmi

    Published 2007
    “…The genetic algorithm approach is widely recognized as an effective and flexible optimization method for system identification. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

    Published 2020
    “…For these reasons, to improve the time and accuracy of the coverage in population-based meta-heuristics and their utilization in HPAs, this thesis presents a novel optimization algorithm called the Raccoon Optimization Algorithm (ROA). …”
    Get full text
    Get full text
    Thesis
  11. 11

    Delay and energy-aware routing for efficient data collection in wireless sensor networks / Ihsan Ali by Ihsan , Ali

    Published 2024
    “…The AFW algorithm reduces unnecessary computations by focusing only on useful edge entries in the graph, thereby expediting the optimization process. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Vehicle pick-up and drop-off schedule optimization in a university setting by Teo, Chun Kit

    Published 2024
    “…For dynamic requests, a handler evaluates acceptance based on time constraints, and schedule re-optimization is triggered as necessary, using the same methods as in the static case. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  13. 13

    Disparity map algorithm for stereo matching process using local based method by Gan, Melvin Yeou Wei

    Published 2022
    “…Hence, this thesis proposes a local-based SVDM algorithm that increases the accuracy on the complex scenes. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Amtree Protocol Enhancement by Multicast Tree Modification and Incorporation of Multiple Sources by Al‐Sharafi, Ali Mohammed Ali

    Published 2008
    “…The results from experiments show that handoff latency using the new algorithms is much lower than using AMTree handoff procedure in both cases, i.e. when the source connects to a subscribed base station or not subscribed base station. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Nomadic people optimizer (NPO) for large-scale optimization problems by Mohamd Salih, Sinan Qahtan

    Published 2019
    “…The basic component of the algorithm consists of several clans and each clan searches for the best place (or best solution) based on the position of their leader. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Predictive Functional Control With Reduced-Order Observer Design Using Particle Swarm Optimization For Pneumatic System by Abd Rahman, Azira

    Published 2020
    “…An optimization technique will be implemented in this project using Particle Swarm Optimization (PSO) algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Color image enhancement of acute leukemia cells in blood microscopic image for leukemia detection sample by Harun, Nor Hazlyna, Abu Bakar, Juhaida, Abd Wahab, Zulkifli, Osman, Muhammad Khusairi, Harun, Hazaruddin

    Published 2020
    “…The segmentation algorithm uses saturation S-component based on Hue, Saturation, Intensity (HSI) color model. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    New signed-digit {0,1,3}-NAF scalar multiplication algorithm for elliptic curve over binary field by Md Yasin, Sharifah

    Published 2011
    “…Also, a new point tripling formula and algorithm are introduced for elliptic curve over binary field using Lopez-Dahab projective coordinates. …”
    Get full text
    Get full text
    Thesis
  19. 19

    A modified weighted support vector machine (WSVM) to reduce noise data in classification problem by Mohd Dzulkifli, Syarizul Amri

    Published 2021
    “…When noise exists in training data, the decision boundary of SVM would deviate from the optimal hyperplane severely. To overcome SVM drawback for noise data problem, WSVM using KPCM algorithm was used but WSVM using kernel-based learning algorithm such as KPCM algorithm suffer from training complexity, expensive computation time and storage memory when noise data contaminate training data. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    A modified weighted support vector machine (WSVM) to reduce noise data in classification problem by Mohd Dzulkifli, Syarizul Amri

    Published 2021
    “…When noise exists in training data, the decision boundary of SVM would deviate from the optimal hyperplane severely. To overcome SVM drawback for noise data problem, WSVM using KPCM algorithm was used but WSVM using kernel-based learning algorithm such as KPCM algorithm suffer from training complexity, expensive computation time and storage memory when noise data contaminate training data. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis