Search Results - (( parallel distribution function algorithm ) OR ( property optimization path algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3
  4. 4

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

    High performance visualization of human tumor growth software by Alias, Norma, Mohd. Said, Norfarizan, Khalid, Siti Nur Hidayah, Sin, Dolly Tien Ching, Phang, Tau Ing

    Published 2008
    “…The platform for high performance computing of the parallel algorithms run on a distributed parallel computer system. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    High performance simulation for brain tumors growth using parabolic equation on heterogeneous parallel computer systems by Pheng, H. S., Alias, Norma, Mohd. Said, Norfarizan

    Published 2007
    “…This paper focuses on the implementation of parallel algorithm for the simulation of brain tumours growth using one dimensional parabolic equation, design on a distributed parallel computer system. …”
    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
    “…The first step lies at the modelling of parallel applications running on heterogeneous parallel computers. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…Nonetheless, the A • algorithm do have some unique properties which is more efficient in finding the shortest path especially in human real-world problem. …”
    Get full text
    Get full text
    Thesis
  9. 9

    High performance simulation for brain tumours growth using parabolic equation on heterogeneous parallel computer system by Pheng H. S., Norma Alias, Norfarizan Mohd Said

    Published 2007
    “…This paper focuses on the implementation of parallel algorithm for the simulation of brain tumours growth using one dimensional parabolic equation, design on a distributed parallel computer system. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    WCDMA teletraffic performance improvement via power resource optimization using distributed parallel genetic algorithm by Prajindra S.K., Tiong S.K., Johnny Koh S.P., Yap D.F.W.

    Published 2023
    “…The algorithm works by finding the minimum transmitter power with the help of Distributed Parallel Genetic Algorithm (DPGA) employed on an offload microcontroller system to form optimal beam coverage to reduce power usage of adaptive antenna at WCDMA base station. …”
    Conference paper
  11. 11

    A critical analysis of simulators in grid by Dakkak, Omar, Che Mohamed Arif, Ahmad Suki, Awang Nor, Shahrudin

    Published 2015
    “…In parallel and distributed computing environment such as "The Grid", anticipating the behavior of the resources and tasks based on certain scheduling algorithm is a great challenging.Thus, studying and improving these types of environments becomes very difficult. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Implementation of Parallel K-Means Algorithm to Estimate Adhesion Failure in Warm Mix Asphalt by Akhtar, M.N., Ahmed, W., Kakar, M.R., Bakar, E.A., Othman, A.R., Bueno, M.

    Published 2020
    “…The results showed that the PKIP algorithm decreases the execution time up to 30 to 46 if compared with the sequential k means algorithm when implemented using multiprocessing and distributed computing. …”
    Get full text
    Get full text
    Article
  13. 13

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…In order to improve the final solutions of a single created tour, The employee bees’ movement radius has been limited, because of avoidance of long random jump between nodes. To reduce the optimization time of the tours created by the artificial bee colony algorithm, the fixed-radius near neighbor 2-opt algorithm was used as well. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Distributed parallel deep learning with a hybrid backpropagation-particle swarm optimization for community detection in large complex networks by Shing, Chiang Ta, Mohammed Al-Andoli, Mohammed Nasser, Wooi, Ping Cheah

    Published 2022
    “…In addition, a distributed environment is set up to conduct parallel optimization of the proposed method so that multi-local optimizations could be performed simultaneously. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16
  17. 17
  18. 18

    Automatic generic process migration system in linux by Zarrabi, Amirreza

    Published 2012
    “…A fexible interface to the underlying checkpoint/ restart subsystem is designed which permits users to specify the migration mechanism according to process constraints. A migration algorithm is designed which attempts to exploit the unique features of the basic migration algorithms to form a generic algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Comparison of DSR, AODV and DSDV routing protocols in mobile ad-hoc networks: A survey by Abdala, Tarek Mosbah, Dasalla, Valeriano A., Daud, Nasarudin

    Published 2014
    “…A mobile ad hoc network (MANET) is a collection of mobile nodes that is connected through a wireless medium forming rapidly changing topologies.Mantes are infrastructure less and can be set up anytime, anywhere.We have conducted survey of protocol properties of various MANET routing algorithms and analyzed them.The routing algorithms considered are classified into three categories proactive (table driven) , reactive (on demand) and Hybrid protocol.The algorithms considered are Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector Routing (AODV) and Destination sequence Vector (DSDV) have been proposed to solve the multi hop routing problem in Ad-hoc networks.The comparison among three routing protocols are based on the various protocol property parameters such as Routing overhead, packet delivery ratio, end-to-end delay, path optimality, and throughput are some metrics commonly used in the comparisons.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20