Search Results - probable distribution ((sensor algorithm) OR (path algorithm))*

  • Showing 1 - 13 results of 13
Refine Results
  1. 1

    EFFICIENT DYNAMIC ADDRESSING BASED ROUTING FOR UNDERWATER WIRELESS SENSOR NETWORKS by ARSHAD, MUHAMMAD AYAZ ARSHAD

    Published 2011
    “…According to our best knowledge, H2-DAB is first addressing based routing approach for underwater wireless sensor networks (UWSNs) and not only has it helped to choose the routing path faster but also efficiently enables a recovery procedure in case of smooth forwarding failure. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Probabilistic evaluation of wind power generation by Razali N.M.M., Misbah M.

    Published 2023
    “…The paper presents an algorithm developed for a random wind speed generator governed by the probability density function of Weibull distribution and evaluates the WTG's output by using the power curve of wind turbines. …”
    Conference paper
  4. 4

    Energy Efficient LEACH (EE-LEACH) Routing Algorithm for Wireless Sensor Networks by Pillay, Kosheila Sundram

    Published 2019
    “…Therefore, this research work proposes an energy-efficient LEACH (EE-LEACH) algorithm to elect CHs based on residual energy, RSSI, and random probability to distribute the load evenly among the CHs. …”
    Get full text
    Get full text
    Thesis
  5. 5

    NSGA-III algorithm for optimizing robot collaborative task allocation in the internet of things environment by Shen, jiazheng, Tang, Sai Hong, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan, Wang, Xinming

    Published 2024
    “…By comparing the total distance and maximum deviation of multiple robot systems, it is proven that this algorithm can effectively balance the path length of each robot in task allocation. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    Estimation of transformers health index based on condition parameter factor and hidden Markov model by Mohd Selva, Amran, Yahaya, Muhammad Sharil, Azis, Norhafiz, Ab Kadir, Mohd Zainal Abidin, Jasni, Jasronita, Yang Ghazali, Young Zaidey

    Published 2018
    “…Subsequently, the future states probability distribution was computed based on the HMM prediction model and viterbi algorithm was applied to find the best optimal path sequence of HI for the respective observable condition. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Energy efficient cluster head distribution in wireless sensor networks by Siew, Zhan Wei

    Published 2013
    “…For network clustering, the distribution of CH selection directly influences the networks lifetime. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    SOVA decoding in symmetric alpha-stable noise by Pu, Chuan Hsian

    Published 2011
    “…Fundamentally, conventional SOVA is designed on the basis of Maximum A-Posteriori Probability (APP) with the assumption of normal distribution. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    A review on path collisions and resources usage in hybrid optical network on chip (HONoC) by Razali, Rina Azlin, Othman, Mohamed

    Published 2015
    “…The larger SoC the more probably the overall computation is heterogeneous and localized rather than evenly balanced over the chip. …”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Class binarization with self-adaptive algorithm to improve human activity recognition by Zainudin, Muhammad Noorazlan Shah

    Published 2018
    “…In comparison, WISDM utilizes an accelerometer sensor embedded in Android smartphone. Meanwhile, PAMAP2 utilizes an accelerometer sensor equipped with three Inertial Measurement Unit (IMU) devices attached to three different placements. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Prediction of rice biomass using machine learning algorithms by Radhwane, Derraz

    Published 2022
    “…The Q-TESI, C-TESI, and L-TESI overcame the LN-TESI in retaining the features’ original probability distribution, minimising the augmentation loss, reducing the VIF, increasing the rs, and decreasing the DNN under- and overfitting. …”
    Get full text
    Get full text
    Thesis