Search Results - (( data selection path algorithm ) OR ( parallel (equalization OR localization) based algorithm ))

Refine Results
  1. 1

    The division free parallel algorithm for finding determinant by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2013
    “…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
  3. 3

    Effective software fault localization based on complex network theory / Abubakar Zakari by Abubakar , Zakari

    Published 2019
    “…Furthermore, two novel fault localization techniques based on complex network theory, namely multiple fault localization based on complex network theory (FLCN-M) and single fault localization based on complex network theory (FLCN-S), are proposed to improve localization effectiveness, and to aid developers’ to localize multiple faults simultaneously in a single diagnosis rank list. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5
  6. 6

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

    Published 2020
    “…MEMPHA, a hypergraphs-based model, aims to aspire to the challenge by providing topology modelling of the target parallel machine and application modelling of the parallel application, which is hypergraph-based model, to abstract the details of HPAs. …”
    Get full text
    Get full text
    Thesis
  7. 7

    An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network by Wan Isni Sofiah, Wan Din, Asyran Zarizi, Abdullah, Razulaimi, Razali, Ahmad Firdaus, Zainal Abidin, Salwana, Mohamad, Eh Phon, Danakorn Nincarean, Cik Feresa, Mohd Foozy

    Published 2019
    “…When this happens, the sensor node cannot receive and send the data until the energy is renewed. To reduce WSN energy consumption, the process of selecting a path to the destination is very important. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

    Published 2013
    “…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11

    New Sequential and Parallel Division Free Methods for Determinant of Matrices by Sharmila, Karim

    Published 2013
    “…Numerical results showed that the parallel methods were able to compute determinants faster than the sequential counterparts, particularly when the tasks were equally allocated. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

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

    Published 2017
    “…Similarly, when data parallelism is introduced in the algorithm the performance of the algorithm improved further by 12% in latency and 17% in throughput when compared to PDWA algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

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

    Published 2020
    “…In some complex problems, the convergence rate can still be poor owing to becoming trapped in local optima. Opposition-based learning (OBL) has shown promising results to address the aforementioned issue. …”
    Get full text
    Get full text
    Thesis
  16. 16

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

    Published 2019
    “…In some complex problems, the convergence rate can still be poor owing to becoming trapped in local optima. Addressing these issues, this research proposes a new general opposition-based learning (OBL) technique inspired by a natural phenomenon of parallel mirrors systems called the parallel mirrors technique (PMT). …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Design and analysis of management platform based on financial big data by Chen, Yuhua, Mustafa, Hasri, Zhang, Xuandong, Liu, Jing

    Published 2023
    “…In addition, a financial data management platform based on distributed Hadoop architecture is designed, which combines MapReduce framework with the fuzzy clustering algorithm and the local outlier factor (LOF) algorithm, and uses MapReduce to operate in parallel with the two algorithms, thus improving the performance of the algorithm and the accuracy of the algorithm, and helping to improve the operational efficiency of enterprise financial data processing. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Parallel Diagonally Implicit Runge-Kutta Methods For Solving Ordinary Differential Equations by Din, Ummul Khair Salma

    Published 2009
    “…All algorithms are written in C language and the parallel code is implemented on Sun Fire V1280 distributed memory system. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Predetermined path of mobile data gathering in wireless sensor networks based on network layout by Ghaleb, Mukhtar, Subramaniam, Shamala, Othman, Mohamed, Ahmad Zulkarnain, Zuriati

    Published 2014
    “…Thus, within each of these divided areas, the multi-hop collection is deployed as a sub-set to the main collection. The ME will select a centroid point between two sub-polling points, subsequently selecting common turning points as the core of the basis of the tour path. …”
    Get full text
    Get full text
    Article