Search Results - (( data distribution methods algorithm ) OR ( _ estimation path algorithm ))

Refine Results
  1. 1

    Coordinate-Descent Adaptation over Hamiltonian Multi-Agent Networks by Azam Khalili, Vahid Vahidpour, Amir Rastegarnia, Ali Farzamnia, Teo, Kenneth Tze Kin, Saeid Sanei

    Published 2021
    “…To implement the ILMS algorithm, each node needs to receive the local estimate of the previous node on the cycle path to update its own local estimate. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  2. 2
  3. 3

    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
    “…Next, the emission probabilities for each of the condition parameter factors were derived based on frequency of occurrence method. 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
  4. 4

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

    Published 2013
    “…Active measurement techniques performed by overlay nodes can provide bandwidth estimations of an end-to-end overlay path. This thesis describes a new algorithm called “COPPA,” which is an in-band path probing algorithm for measuring the end-to-end available bandwidth of an overlay path accurately and continuously. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

    Published 2015
    “…In this study, two algorithms will be focused on. This study compares the Dijkstra’s, and A* algorithm to estimate search time and distance of algorithms to find the shortest path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Totally opportunistic routing algorithm for underwater wireless sensor network by Rahman, Ziaur

    Published 2019
    “…The former can be localized by utilizing any of the existing schemes, whereas for the later a Time of Arrival (ToA) based distributed 3-dimensional Euclidean distance estimation method has proposed. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

    Published 2016
    “…Using this method, the need for the knowledge of the degree of nonlinearity in advance can be avoided. The proposed algorithm models the Wiener-Hammerstein linear and nonlinear components in the secondary path and applies the estimated degree of nonlinearity of the nonlinear secondary path in the control algorithm design.In previous works, SEF-NLFXLMS and THF-NLFXLMS algorithms for Hammerstein and Wiener structures were developed where the acoustic path is assumed to be a unit gain. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score by Mirza Rizwan, Sajid

    Published 2021
    “…The estimated CVDs path model can be implemented as a disease delay strategy in clinical settings. …”
    Get full text
    Get full text
    Thesis
  10. 10

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

    Published 2019
    “…These algorithms are inspired by the estimation capability of the well-known Kalman filter estimation method. …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Published 2004
    “…This means A • algorithm only calculates and consider the next node m path that has the lowest value of G and F, plus searching the shortest route by using heuristic estimation in Manhattan method. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Nonlinear adaptive algorithm for active noise control with loudspeaker nonlinearity by Dehkordi, Sepehr Ghasemi

    Published 2014
    “…The proposed THF-NLFXLMS algorithm models the Wiener secondary path and applies the estimated degree of nonlinearity of the nonlinear secondary path in the control algorithm design. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Development of mapping methods for seagrass meadows in Malaysia by using landsat images by Hossain, Mohammad Shawkat

    Published 2015
    “…The next study was focused on assessment of the geometric and radiometric fidelity of images reconstructed by three potential gap-filling methods: (1) Geostatistical Neighbourhood Similar Pixel Interpolator (GNSPI), (2) Weighted linear regression algorithm integrated with Laplacian prior regularization, and (3) Local Linear Histogram Matching methods. …”
    Get full text
    Get full text
    Thesis
  15. 15

    GPS boundary navigation of DrosoBots using MATLAB simulation by Zainal Abidin, Zulkifli, Ngah , Vmi Kalthum, Arshad, Mohd Rizal, Kok , Chee Hou

    Published 2010
    “…To implement this, region recognition and several path planning algorithms have been utilized. Besides that, pixilation of path is also used to estimate the coverage of the path planning. …”
    Get full text
    Get full text
    Proceeding Paper
  16. 16

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…By combining physical layer capacity with MAC layer estimated congestion value, a new delay-based load-balancing routing (DLBR) algorithm is proposed in this paper. …”
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…By combining physical layer capacity with MAC layer estimated congestion value, a new delay-based load-balancing routing (DLBR) algorithm is proposed in this paper. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18
  19. 19
  20. 20