Search Results - (( parallel evaluation method algorithm ) OR ( course optimization method algorithm ))

Refine Results
  1. 1

    A basic study on hybrid systems for small race car to improve dynamic performance using lap time simulation by Kobayashi, Ikkei, Ogawa, Kazuki, Uchino, Daigo, Ikeda, Keigo, Kato, Taro, Endo, Ayato, Mohamad Heerwan, Peeie, Narita, Takayoshi, Kato, Hideaki

    “…The realization of the proposed hybrid system requires independent control algorithms for the two power systems, engine and electric motor, that take into consideration the state of the vehicle and the driver’s input; this system can be assumed to be a servo model system with multiple inputs and outputs and analyzed to obtain the optimal operation algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

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

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

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

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

    A harmony search algorithm for university course timetabli by Al-Betar, Mohammed Azmi, Khader, Ahamad Tajudin

    Published 2012
    “…The major thrust of this algorithm lies in its ability to integrate the key components of population-based methods and local search-based methods in a simple optimization model. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    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
  10. 10
  11. 11

    Meta-Heuristic Algorithms for Learning Path Recommender at MOOC by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N.

    Published 2021
    “…We have developed Metaheuristic algorithms includes the Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), to solve the proposed model. …”
    Get full text
    Get full text
    Article
  12. 12

    The Parallel Fuzzy C-Median Clustering Algorithm Using Spark for the Big Data by Mallik, Moksud Alam, Zulkurnain, Nurul Fariza, Siddiqui, Sumrana, Sarkar, Rashel

    Published 2024
    “…Therefore, we develop a Parallel Fuzzy C-Median Clustering Algorithm Using Spark for Big Data that can handle large datasets while maintaining high accuracy and scalability. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

    Published 2018
    “…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Improving parallel self-organizing map using heterogeneous uniform memory access / Muhammad Firdaus Mustapha by Mustapha, Muhammad Firdaus

    Published 2018
    “…Finally, this research designs and implements an enhanced parallel SOM architecture through combining two parallel methods which are network and data partitioning. …”
    Get full text
    Get full text
    Thesis
  15. 15

    A spark-based parallel fuzzy C median algorithm for web log big data by Mallik, Moksud Alam, Zulkurnain, Nurul Fariza, Nizamuddin, Mohammed Khaja, Sarkar, Rashal, Chalil, Aboosalih Kakkat

    Published 2022
    “…Based on the Rand Index and SSE (sum of squared error), the parallel Fuzzy C median algorithm's performance is evaluated in the PySpark platform. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Adapting And Hybridising Harmony Search With Metaheuristic Components For University Course Timetabling by Al-Betar, Mohammed Azmi

    Published 2010
    “…Harmony Search Algorithm (HSA) is a recent metaheuristic population-based method. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Harmony great deluge for solving curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    “…University course timetabling which has been determined as non deterministic polynomial problem that accept widely as problem that are intractable.An efficient algorithm does not exist that is guaranteed to find an optimal solution for such problems.The design of good algorithm to find new methods and techniques to solve such problem is a very active area of research.This paper presents the adaption of the hybridizing between harmony search with great deluge algorithm for solving curriculum-based course timetabling problems.The algorithm can be adapted to the problem.Results were not comparatively better than those previously known as best solution.Proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid by Wahid, Juliana

    Published 2017
    “…The real data of UUM CAS timetable was analyzed and processed using the proposed algorithms. The result shows that the quality cost of UUM CAS course timetabling produced by the proposed algorithms is better compared to the course timetable produced by the ready-made software package. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Evaluate the performance of university timetabling problem with various artificial intelligence techniques by Hooi, Charmaine Wai Yee

    Published 2025
    “…Over time, numerous algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), and other approaches have been introduced to address the challenges of optimizing class schedules. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  20. 20

    Web based personalized university timetable for UiTM students using genetic algorithm / Mohd Radhi Fauzan Jamli and Ahmad Firdaus Ahmad Fadzil by Jamli, Mohd Radhi Fauzan, Ahmad Fadzil, Ahmad Firdaus

    Published 2024
    “…The proposed approach utilizes genetic algorithms to dynamically produce optimized timetables based on individual student needs, with real-time data scraping from 'iCRESS' ensuring the system stays up to date with the latest course information for accurate timetable generation. …”
    Get full text
    Get full text
    Get full text
    Article