Search Results - (( discrete simulation path algorithm ) OR ( parallel optimization path algorithm ))*

Refine Results
  1. 1

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Discrete simulation framework for wireless cellular networks. by Al-Sanabani, Maher Ali, K. Subramaniam, Shamala, Othman, Mohamed, Ahmad Zulkarnain, Zuriati

    Published 2008
    “…In addition the simulator incorporates detail algorithms for the correlated components between the entities of the cellular networks and the development of the discrete simulator. …”
    Get full text
    Get full text
    Article
  3. 3

    Indoor global path planning based on critical cells using dijkstra algorithm by Azrul Amri, Jamal, Engku Fadzli Hasan, Syed Abdullah, Fatma Susilawati, Mohamad

    Published 2015
    “…Simulations results show that the proposed algorithm enhances performance and speed compared to the traditional Dijkstra’s algorithm.…”
    Get full text
    Get full text
    Article
  4. 4

    Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime by Ahmad, Noor Azlan

    Published 2008
    “…The performance analysis of the proposed algorithms was conducted by using the discrete-event simulator, OMNeT++. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    “…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
    Get full text
    Get full text
    Article
  6. 6

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…When compared to the Ant Colony Optimization algorithm, Simulated Annealing and Genetic Algorithm, the results obtained from African Buffalo Optimization show that the algorithm works well and can be extended to solving problems like: path planning, scheduling, vehicle routing in addition to other constraint-driven problems.…”
    Get full text
    Get full text
    Get full text
    Article
  7. 7
  8. 8
  9. 9

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Fair and fit resource allocation algorithm for network-controlled device-to-device (D2D) communication / Yusmardiah Yusuf, Darmawaty Mohd. Ali and Roslina Mohamad by Yusuf, Yusmardiah, Mohd. Ali, Darmawaty, Mohamad, Roslina

    Published 2021
    “…In this paper, a Fair and Fit Resource Allocation (FFRA) algorithm is proposed which exploits the path loss experienced by the potential D2D user equipments (UEs) when choosing the communication path. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11
  12. 12

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

    Published 2016
    “…In order to evaluate the proposed algorithm, a series of experiments to implement Discrete Event Simulation (DES) of a LEO satellite network by using ns-2 and C/C++ are conducted. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…We reviewed 57 SKF papers. 16 of them on fundamental improvements, 9 on extension of the algorithm to discrete problems and 25 on their applications. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Robot path planning using family of SOR iterative methods with laplacian behaviour-based control by Azali Saudi

    Published 2015
    “…In addition, the newly proposed LBBC overcomes the drawback of the existing GDS that face difficulty when handling complex environment. Finally, the path planning problem is solved by combining the fast iterative method with the robust path searching LBBC technique, so that the path planning algorithm is capable of handling large and complex environment.…”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    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
    “…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. Extensive discrete-event simulations have been developed to assess the performance of the proposed algorithm. …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    Multi-user mmWave MIMO channel estimation with hybrid Beamforming over frequency selective fading channels by Uwaechia, Anthony Ngozichukwuka, Mahyuddin, Nor Muzlifah, Ain, Mohd Fadzil, Abdul Latiff, Nurul Muazzah, Za'bah, Nor Farahidah

    Published 2020
    “…Simulation results show that the proposed algorithm is effective and offer a better CE performance in terms of MSE when compared to the generalized block orthogonal matching pursuit (G-BOMP) algorithm that does not possess a pruning step.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  18. 18

    A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors by Lee, Weng Fook

    Published 2008
    “…Different adder architectures are investigated for suitability on synthesis implementation of large data bus size adder for efficient usage within the ALU. An adder algorithm using repetitive constructs in a parallel algorithm that allows for efficient and optimal synthesis for large data bus size is proposed as a suitable implementation for the adder within the ALU. …”
    Get full text
    Thesis
  19. 19

    Low power pipelined FFT processor architecture on FPGA by Mohd Hassan, Siti Lailatul, Sulaiman, Nasri, Abdul Halim, Ili Shairah

    Published 2018
    “…Fast Fourier Transform (FFT) processor is the hardware implementation for FFT algorithms for Discrete Fourier Transform (DFT) which compute any signal in time domain to frequency domain. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks by Chien, Stephen Lim Een, Raja Maamor Shah, Raja Noor Farah Azura, Othman, Mohamed

    Published 2016
    “…A tree visualisation was constructed based on its connectivity to enable the generation of formulae for optimal diameter and average optimal path lengths. …”
    Get full text
    Get full text
    Conference or Workshop Item