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

Refine Results
  1. 1

    Improved hybrid teaching learning based optimization-jaya and support vector machine for intrusion detection systems by Mohammad Khamees Khaleel, Alsajri

    Published 2022
    “…While the effectiveness of some machine learning algorithms in detecting certain types of network intrusion has been ascertained, the situation remains that no single method currently exists that can achieve consistent results when employed for the detection of multiple attack types. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Dual search maximum power point algorithm based on mathematical analysis under partially-shaded conditions by Hajighorbani, Shahrooz

    Published 2016
    “…Interestingly, the experimental results under different irradiances also show that the proposed algorithm can detect the GMPP faster in comparison with other methods. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Dynamic partitioning and data allocation method on heterogeneous architecture / Muhammad Helmi Rosli by Rosli, Muhammad Helmi

    Published 2015
    “…Each experiment highlight the advantages and disadvantages of the experimental architecture.The disadvantages from each experiment prompts the design of dynamic parallel partitioning and allocating framework. The case study use for this experiment is Sobel edge detection algorithm. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using asic design flow: article / Nurzaima Mahmod by Mahmod, Nurzaima

    “…The scope of this paper is to optimize the DNA sequences alignment on the matrix rilling module by implementing a parallel method of the Smith-Waterman algorithm. …”
    Get full text
    Get full text
    Article
  6. 6

    A parallel ensemble learning model for fault detection and diagnosis of industrial machinery by Shing, Chiang Ta, Mohammed Al-Andoli, Mohammed Nasser, Kok, Swee Sim, Seera, Manjeevan, Chee, Peng Lim

    Published 2023
    “…Deep learning has recently emerged as effective methods for machine FDD applications. However, the gradient descent optimization method that is commonly used in deep learning suffers from several limitations, such as high computational cost and local sub-optimal solutions. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

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

    Published 2020
    “…Any optimization algorithm is suitable for only a specific domain of optimization problems. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using ASIC design flow / Nurzaima Mahmod by Mahmod, Nurzaima

    Published 2010
    “…The scope of this paper is to optimize the DNA sequences alignment on the matrix filling module by implementing a parallel method of the SmithWaterman algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Model of Improved a Kernel Fast Learning Network Based on Intrusion Detection System by Ali, Mohammed Hasan, Mohamed Fadli, Zolkipli

    Published 2019
    “…As network attackers keep changing their methods of attack execution to evade the deployed intrusion-detection systems (IDS), machine learning (ML) algorithms have been introduced to boost the performance of the IDS. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

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

    Published 2018
    “…The major contribution of this research is to propose MTS method for solving UTSP in both sequential and parallel approach and it is shown that the algorithms are able to produce comparable results for most of the cases from literature and the computational times can be reduced significantly for more than 80% by the parallel execution. …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Parallel system for abnormal cell growth prediction based on fast numerical simulation by Alias, Norma, Islam, Md. Rajibul, Shahir, Rosdiana, Hamzah, Norhafizah, Satam, Noriza, Abd. Ghaffar, Zarith Safiza, Darwis, Roziha, Ludin, Eliana, Azami, Masrin

    Published 2010
    “…The paper focuses on a numerical method for detecting, visualizing and monitoring abnormal cell growth using large-scale mathematical simulations. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Autonomous anomaly detection using density-based features in streaming data / Muhammmad Yunus Iqbal Basheer by Iqbal Basheer, Muhammmad Yunus

    Published 2023
    “…Hence, it is critical for an anomaly detection algorithm to detect data anomalies patterns. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15
  16. 16

    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
    “…In the partitioning phase, the data is partitioned into smaller subsets that can be clustered in parallel across multiple nodes. The suggested method, implemented in the Databricks cloud platform provides high clustering accuracy, as measured by clustering evaluation metrics such as the silhouette coefficient, cost function, partition index, clustering entropy. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Online system identification development based on recursive weighted least square neural networks of nonlinear hammerstein and wiener models. by Kwad, Ayad Mahmood

    Published 2022
    “…This research introduces a developed method for online system identification based on the Hammerstein and Wiener nonlinear block-oriented structure with the artificial neural networks (NN) advantages and recursive weighted least squares algorithm for optimizing neural network learning in real-time. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Optimization of extractive Automatic Text Summarization using Decomposition-based Multi-objective Differential Evolution and parallelization by Hazmi Wahab, Muhammad Hafizul

    Published 2024
    “…It is built upon the foundation of Differential Evolution for Multi-objective optimization (DEMO) and the weighted sum method (WS), coupled with an innovative ATS repair operator scheme. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Single and Multiple variables control using Tree Physiology Optimization by Halim, A.H., Ismail, I.

    Published 2017
    “…The exploration is amplified from roots growth counterparts. In the proposed method, each shoot from each branch search for possible solution in parallel and the fitness is evaluated based on all best values found by branch search. …”
    Get full text
    Get full text
    Article