Search Results - (( using optimization means algorithm ) OR ( _ optimization window algorithm ))

Refine Results
  1. 1

    Removal of high density salt and pepper noise from image and video based on optimal decision based algorithm by Khammar, Mohammad Reza, Saripan, M. Iqbal, Marhaban, Mohammad Hamiruce, Ishak, Asnor Juraiza

    Published 2014
    “…Detection is provided by using statistical analysis in each window, then the appropriate replacement for the noisy pixel is conducted from given values inside the current window or adjacent reconstructed pixels based on mean calculation and also, for very high density of noise which density of noise is bigger than 80%, the reconstruction is based on a recursive approach. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Noise Cancellation method in assistive listening system by Noor Aliff, Noor Affande

    Published 2020
    “…Those algorithms were Least Means Square, Normalize-Least Means Square, Recursive Least Square, Simple SetMembership Algorithm and Dynamic Set-Membership Affine Projection Algorithm. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  3. 3

    Efficient management of Top-k queries over Uncertain Data Streams with dynamic Sliding Window Model by Raja Wahab, Raja Azhan Syah

    Published 2024
    “…Current research on tackling uncertainty revolves around creating specifically tailored algorithms that can operate in the presence of value uncertainty using both a count-based and a time-based approach. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Optimization of Microbial Electrolysis Cell for Sago Mill Wastewater Derived Biohydrogen via Modeling and Artificial Neural Network by Mohamad Afiq, Mohd Asrul

    Published 2023
    “…The model reliability describes the second sub-objective, which is to determine the feasible operating window of the MEC using multiple-objective optimization based on the nonlinear convex method using gradient descent algorithm as the objective function in maximizing the percentage efficiency of the MEC after validating the mathematical model. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Random subspace K-NN based ensemble classifier for driver fatigue detection utilizing selected EEG channels by Rashid, Mamunur, Mahfuzah, Mustafa, Norizam, Sulaiman, Nor Rul Hasma, Abdullah, Rosdiyana, Samad

    Published 2021
    “…An optimal channel selection approach and a competent classification algorithm might be viewed as a critical aspect of efficient fatigue detection by the driver. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    Object tracing from synthetic fluid spray through instance segmentation by Md Refat Khan, Pathan

    Published 2024
    “…The resulting objects were then analyzed using a customized nearest neighbor algorithm to calculate their correspondence between frames and a BFS algorithm was used to trace their movement path. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Analysis and decentralised optimal flow control of heterogeneous computer communication network models by Ku-Mahamud, Ku Ruhana

    Published 1993
    “…The decentralised optimal local flow control of the multiclass computer communication networks with single and multiple transmission links is shown to be a state dependent window type mechanism that has been traditionally used in practice. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Zakaria, M.N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
    Get full text
    Get full text
    Article
  10. 10

    Optimized crossover genetic algorithm for vehicle routing problem with time windows by Nazif, Habibeh, Lee, Lai Soon

    Published 2010
    “…Conclusion/Recommendations: This study presented a genetic algorithm for solving vehicle routing problem with time windows using an optimized crossover operator. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision by Abu Raid, Fadi Imad Osman

    Published 2021
    “…The proposed algorithms aim to accelerate the processes of distortion removal and rectification using precomputed combined maps. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Pierre, D.M., Zakaria, N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
    Get full text
    Get full text
    Article
  13. 13

    Solving multi-objective dynamic vehicle routing problem with time windows using multi-objective algorithm by Khoo, Thau Soon

    Published 2022
    “…It is difficult and challenging to develop an algorithm that can produce consistent near-optimal solutions even after many runs, average near-optimal solutions that have the least difference in magnitude, broader Pareto set, and iii achieve near-optimal solutions but highly sought after if it is commercially viable. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  14. 14

    An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks by Al-Kharasani, Ameen Mohammed Abdulkarem, Othman, Mohamed, Abdullah, Azizol, Kweh, Yeah Lun

    Published 2016
    “…This article analyses and evaluates a new time sliding window traffic marker algorithm called the Optimized time sliding window Three Colour Marker (OtswTCM). …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

    Published 2024
    “…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows by Sankor, Salah Mortada Shahen

    Published 2022
    “…The vehicle routing problem with time windows (VRPTW) is a non-deterministictime hard (NP-hard) with combinatorial optimization problem (COP). …”
    Get full text
    Get full text
    Thesis
  17. 17

    Simulation for dynamic patients scheduling based on many objective optimization and coordinator by Mahmed, Ali Nader, Mohd Nizam, Mohmad Kahar

    Published 2024
    “…Finally, the role of the coordinator is to select a subset of patients from the window and pass them to the optimization algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Clustering technique is able to find hidden patterns and to extract useful information from huge data. Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    A near-optimal centroids initialization in K-means algorithm using bees algorithm by Mahmuddin, Massudi, Yusof, Yuhanis

    Published 2009
    “…The K-mean algorithm is one of the popular clustering techniques.The algorithm requires user to state and initialize centroid values of each group in advance. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20