Search Results - parallel evaluation ((((case algorithm) OR (based algorithm))) OR (_ algorithm))

Refine Results
  1. 1

    Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad by Saima Gulzar, Ahmad

    Published 2017
    “…Eventually, the workflow is executed. The second algorithm is a variation in first algorithm in which data parallelism is introduced in each partition. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

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

    A Community-Based Fault Isolation Approach for Effective Simultaneous Localization of Faults by Zakari, Abubakar, Lee, Sai Peck, Targio Hashem, Ibrahim Abaker

    Published 2019
    “…This paper proposes a new approach that makes use of a divisive network community clustering algorithm to isolate faults into separate fault-focused communities that target a single fault each. …”
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Parallelization of speech compression based algorithm based on human auditory system on multicore system by Gunawan, Teddy Surya, Kartiwi, Mira, Khalifa, Othman Omran

    Published 2012
    “…Finally, the performance of the developed parallel algorithm was evaluated using Perceptual Evaluation of Speech Quality (PESQ) and parallel execution time. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

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

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

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

    Published 2004
    “…All the numerical results are given to illustrate the algorithms developed for the cases that we were tested. …”
    Get full text
    Get full text
    Thesis
  9. 9

    A test case generation framework based on UML statechart diagram by Salman, Yasir Dawood

    Published 2018
    “…Unfortunately, existing studies in this domain are not sufficiently comprehensive in describing the major processes of the automated test case generation. Furthermore, the algorithms used for test case generation are not provided or well described. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    An Experimental Study on Relationship between Performance and Energy Consumption of Serial and Parallel Text Searching Algorithm. by Isahak, Siti Zulaikha

    Published 2013
    “…In this paper, text searching algorithm is using to study the relationship between performance of computer and amount of energy produced in serial and parallel text searching algorithm. …”
    Get full text
    Get full text
    Final Year Project
  11. 11

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

    PMT : opposition based learning technique for enhancing metaheuristic algorithms performance by Hammoudeh, S. Alamri

    Published 2020
    “…To evaluate the PMT’s performance and adaptability, the PMT was applied to four contemporary metaheuristic algorithms, Differential Evolution, Particle Swarm Optimization, Simulated Annealing, and Whale Optimization Algorithm, to solve 15 well-known benchmark functions as well as 2 real world problems based on the welded beam design and pressure vessel design. …”
    Get full text
    Get full text
    Thesis
  14. 14
  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

    Performance Evaluation Of Combined Code-Space Division Multiple Access With Enhanced Parallel Interference Cancellation by Odeh, Nidhal A.S.

    Published 2007
    “…By using limited number of available spreading codes, a novel code assignment algorithm is proposed to maintain the maximum orthogonality among users. …”
    Get full text
    Get full text
    Thesis
  17. 17

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

    Published 2022
    “…Best Hammerstein parallel NN polynomial based model and series-parallel NN polynomial model are 88.75% and 93.9% respectively, for best Hammerstein parallel NN sigmoid based model and series-parallel NN sigmoid based model 78.26% and 95.95% respectively, and for best Hammerstein parallel NN hyperbolic tangent based model and series-parallel NN hyperbolic tangent based model 70.7% and 96.4% respectively. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    PMT: opposition-based learning technique for enhancing meta-heuristic performance by Alamri, Hammoudeh S., Kamal Z., Zamli

    Published 2019
    “…The experimentally, the PMT shows promising results by accelerating the convergence rate against the original algorithms with the same number of fitness evaluations.…”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

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

    GPU-based odd and even hybrid string matching algorithm by Rahbari, Ghazal, Abdul Rashid, Nur’Aini, Husain, Wahidah

    Published 2016
    “…String matching is considered as one of the fundamental problems in computer science.Many computer applications provide the string matching utility for their users, and how fast one or more occurrences of a given pattern can be found in a text plays a prominent role in their user satisfaction.Although numerous algorithms and methods are available to solve the string matching problem, the remarkable increase in the amount of data which is produced and stored by modern computational devices demands researchers to find much more efficient ways for dealing with this issue.In this research, the Odd and Even (OE) hybrid string matching algorithm is redesigned to be executed on the Graphics Processing Unit (GPU), which can be utilized to reduce the burden of compute-intensive operations from the Central Processing Unit (CPU).In fact, capabilities of the GPU as a massively parallel processor are employed to enhance the performance of the existing hybrid string matching algorithms.Different types of data are used to evaluate the impact of parallelization and implementation of both algorithms on the GPU. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item