Search Results - (( parallel evaluation method algorithm ) OR ( using optimization window algorithm ))

Refine Results
  1. 1

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

    Published 2021
    “…These algorithms are then parallelized using Compute Unified Device Architecture CUDA C language to run on Graphics Processing Unit GPU for hardware acceleration. …”
    Get full text
    Get full text
    Thesis
  2. 2

    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
  3. 3

    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
  4. 4

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

    Published 2022
    “…Our algorithm uses non-fitness evolutionary distributed parallelized adaptive large neighbourhood search (NEDPALNS). …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  5. 5

    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
  6. 6

    Parallel Execution of Runge-Kutta Methods for Solving Ordinary Differential Equations by Siri, Zailan

    Published 2004
    “…The method used here is actually have been tailored made for the purpose of parallel machine where the subsequent functions evaluations do not depend on the previous function evaluations. …”
    Get full text
    Get full text
    Thesis
  7. 7

    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
  8. 8

    Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems by Shakeel Ahmed, Kamboh

    Published 2014
    “…To implement the parallel algorithms a distributed parallel computing laboratory using easily available low cost computers is setup. …”
    Get full text
    Get full text
    Thesis
  9. 9

    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 proposed algorithm was evaluated using benchmark datasets comprising 56 VRPTW instances and 56 Pickup and Delivery Problems with Time Windows (PDPTW). …”
    Get full text
    Get full text
    Thesis
  10. 10

    Enhancing performance of XTS cryptography mode of operation using parallel design by Ahmed Alomari, Mohammad

    Published 2009
    “…In addition, the parallel XTS mode was also simulated using Twofish and RC6 encryption algorithms. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs. by Ismail, Fudziah, Siri, Zailan, Othman, Mohamad, Suleiman, Mohamed

    Published 2009
    “…Diagonally Implicit Runge-Kutta (DIRK) methods are amongst the most useful and cost-effective methods for solving initial value problems but the dependency of the functions evaluations on the previous functions evaluations makes DIRK method not so favourable for parallel computers. …”
    Get full text
    Get full text
    Article
  12. 12

    Communication and computational cost on parallel algorithm of PDE elliptic type by Alias, Norma

    Published 2009
    “…Due to this needs, this paper presents the parallel performance evaluations of algorithms that will be discussed in term of communication and computational cost.…”
    Get full text
    Get full text
    Book Section
  13. 13
  14. 14

    Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil by Ahmad, Ahmad Firdaus

    Published 2014
    “…MR is an emerging parallel processing framework that hides the complex parallelization processes by employing the functional abstraction of "map and reduce" The Performance of the parallelized GA via MR and PSO via MR are evaluated using an analogous case study to find out the speedup and efficiency in order to measure the scalability of both proposed algorithms. …”
    Get full text
    Get full text
    Thesis
  15. 15

    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
  16. 16

    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
  17. 17

    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm by Abubakar, Adamu, Chiroma, Haruna, Khan, Abdullah, Mohamed, Elbaraa Eldaw Elnour

    Published 2016
    “…This signifies that the training was successful based on the fitted values of the window size. Thus the proposed model trained with the CS algorithm provides a high convergence rate to the true global minimum and a better optimal solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19
  20. 20

    Flexible window-based scheduling with critical worst case latency evaluations for real time traffic in time sensitive networks by Muftah, Shalghum Khaled

    Published 2022
    “…The second part proposes an optimized flexible window-overlapping scheduling (OFWOS) algorithm that optimizes the offset difference ( ) between the samepriority TT windows in the adjacent nodes. …”
    Get full text
    Get full text
    Thesis