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

Search alternatives:

Refine Results
  1. 1
    Embedded parallel distributed artificial intelligent processors for adaptive beam forming in WCDMA system

    Embedded parallel distributed artificial intelligent processors for adaptive beam forming in WCDMA system by Krishnan P.S., Kiong T.S., Koh J., Yap D.

    Published 2023
    Subjects:
    Conference paper
    Save to List
    Saved in:
  2. 2
    Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems

    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
    Save to List
    Saved in:
  3. 3
    State-Aware re-configuration model for multi-radio wireless Mesh Networks

    State-Aware re-configuration model for multi-radio wireless Mesh Networks by Zakaria, Omar, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Khalifa, Othman Omran, Azram, Mohammad, Goudarzi, Shidrokh, Jivanadham, Lalitha Bhavani, Zareei, Mahdi

    Published 2017
    “…In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients’ traffic due to the re-configuration process. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Intelligent motion planning of a mobile robot by using convolutional neural network / Siti Asmah Abdullah

    Intelligent motion planning of a mobile robot by using convolutional neural network / Siti Asmah Abdullah by Siti Asmah, Abdullah

    Published 2019
    “…It trains by using labelled data which comes by eight different folders represent the eight different movements; up, up-right, right, right-down, down-left, left, and left-up. By the path reference created by A* algorithm the robot is capable in optimizing its path to reach the designated destination. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri

    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

    Published 2013
    “…The main objectives of this project is to design the DNA sequence generator module using the Eulerian Path algorithm. This project is designed based on speed optimization. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  6. 6
    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri

    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

    Published 2013
    “…The objective of this project is to design the DNA sequence generator modules using the Eulerian Path Algorithm. This project is designed based on speed optimization. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    High performance visualization of human tumor growth software

    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
    Save to List
    Saved in:
  9. 9
    Energy-Aware Routing Hole Detection Algorithm in the Hierarchical Wireless Sensor Network

    Energy-Aware Routing Hole Detection Algorithm in the Hierarchical Wireless Sensor Network by Najm Us, Sama, Kartinah, Zen, Atiq Ur, Rahman, Aziz Ud, Din

    Published 2019
    “…In this paper a novel energy efficient routing hole detection (EEHD) algorithm is presented, on the detection of routing hole, the periodic re-clustering is performed to avoid the long detour path. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…While this algorithm guarantees to find the shortest path for each single net, if it exists, each routed net will form obstacle for later paths. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    High performance simulation for brain tumors growth using parabolic equation on heterogeneous parallel computer systems

    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
    Save to List
    Saved in:
  12. 12
    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures

    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
    Save to List
    Saved in:
  13. 13
    High performance simulation for brain tumours growth using parabolic equation on heterogeneous parallel computer system

    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
    Save to List
    Saved in:
  14. 14
    WCDMA teletraffic performance improvement via power resource optimization using distributed parallel genetic algorithm

    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
    Save to List
    Saved in:
  15. 15
    A critical analysis of simulators in grid

    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
    Save to List
    Saved in:
  16. 16
    Implementation of Parallel K-Means Algorithm to Estimate Adhesion Failure in Warm Mix Asphalt

    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
    Save to List
    Saved in:
  17. 17
    Routing problem in rectangular mesh network using shortest path based Greedy method

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Traffic management algorithms for LEO satellite networks

    Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

    Published 2016
    “…In dealing with traffic routing problem, two algorithms, Dijkstra's Shortest Path and Genetic Algorithm (GA) are combined together and enhanced to re-strategize a better routing mechanism for a heterogeneous mix of traffic classes ranging from traditional voice calls to multimedia data services in Low Earth Orbit (LEO) satellite networks. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Routing problem in rectangular mesh network using shortest path based Greedy method

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Ant-based vehicle congestion avoidance framework using vehicular networks / Mohammad Reza Jabbarpour Sattari

    Ant-based vehicle congestion avoidance framework using vehicular networks / Mohammad Reza Jabbarpour Sattari by Sattari, Mohammad Reza Jabbarpour

    Published 2015
    “…Previous researches concentrated on using static algorithms to find the shortest path in VTRSs. However, providing a shortest path without considering other factors such as congestion, accidents, obstacles, travel time and speed is not a proper solution for vehicle traffic congestion problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: