Search Results - (( weibull distributions process algorithm ) OR ( parallel evaluation method algorithm ))*

Refine Results
  1. 1

    Time based internet traffic policing and shaping with Weibull traffic model / Mohd Azrul Abdullah by Abdullah, Mohd Azrul

    Published 2015
    “…Analysis results present Weibull Distribution model is the best fitted model. …”
    Get full text
    Get full text
    Article
  2. 2

    Time based internet traffic policing and shaping with Weibull traffic model / Mohd Azrul Abdullah by Abdullah, Mohd Azrul

    Published 2015
    “…Analysis results present Weibull Distribution model is the best fitted model. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Peak time bandwidth control algorithms with fitted traffic model on broadband network YouTube video traffic: article / Aini Azmi by Azmi, Aini

    Published 2016
    “…Bandwidth Control Algorithms is developed based on Peak Time of day and night. …”
    Get full text
    Get full text
    Article
  4. 4

    Peak time bandwidth control algorithms with fitted traffic model on broadband network YouTube video traffic / Aini Azmi by Azmi, Aini

    Published 2016
    “…Bandwidth Control Algorithms is developed based on Peak Time of day and night. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Risk analysis of the copula dependent aggregate discounted claims with Weibull inter-arrival time by Siti Norafidah Mohd Ramli, Sharifah Farah Syed Yusoff Alhabshi, Nur Atikah Mohamed Rozali

    Published 2021
    “…We model the recursive moments of aggregate discounted claims, assuming the inter-claim arrival time follows a Weibull distribution to accommodate overdispersed and underdispersed data set. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Parametric and Semiparametric Competing Risks Models for Statistical Process Control with Reliability Analysis by Mohamed Elfaki, Faiz Ahmed

    Published 2004
    “…From the simulation study for this particular case, we can conclude that Weibull distribution describes well the nature of the model concerned as compared to the exponential distribution in terms of the mean value of parameter estimates, bias, and the root means square error. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Multiobjective optimization using particle swarm optimization with non-Gaussian random generators by Ganesan, T., Vasant, P., Elamvazuthi, I.

    Published 2016
    “…The two non-Gaussian distributions are the Weibull and Gamma distributions. …”
    Get full text
    Get full text
    Article
  9. 9

    Multiobjective optimization using particle swarm optimization with non-Gaussian random generators by Ganesan, T., Vasant, P., Elamvazuthi, I.

    Published 2016
    “…The two non-Gaussian distributions are the Weibull and Gamma distributions. …”
    Get full text
    Get full text
    Article
  10. 10

    Multiobjective optimization using particle swarm optimization with non-Gaussian random generators by Ganesan, T., Vasant, P., Elamvazuthi, I.

    Published 2016
    “…The two non-Gaussian distributions are the Weibull and Gamma distributions. …”
    Get full text
    Get full text
    Article
  11. 11

    Multiobjective optimization using particle swarm optimization with non-Gaussian random generators by Ganesan, T., Vasant, P., Elamvazuthi, I.

    Published 2016
    “…The two non-Gaussian distributions are the Weibull and Gamma distributions. …”
    Get full text
    Get full text
    Article
  12. 12

    Adaptive policing and shaping algorithms on inbound traffic using generalized Pareto distribution / Nor Azura Ayop by Ayop, Nor Azura

    Published 2016
    “…Log likelihood estimation technique is used to fit the best 2-parameter CDF compared to Weibull, Normal and Rician distribution model. The percentage level 5% under original bandwidth used is developed on policing and shaping algorithms to control bandwidth used. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Parallel Execution of Runge-Kutta Methods for Solving Ordinary Differential Equations by Siri, Zailan

    Published 2004
    “…The method used here is actually have been tailored made for the purpose of parallel machine where the subsequent functions evaluations do not depend on the previous function evaluations. …”
    Get full text
    Get full text
    Thesis
  14. 14

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

    Enhancing performance of XTS cryptography mode of operation using parallel design by Ahmed Alomari, Mohammad

    Published 2009
    “…In addition, the parallel XTS mode was also simulated using Twofish and RC6 encryption algorithms. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs. by Ismail, Fudziah, Siri, Zailan, Othman, Mohamad, Suleiman, Mohamed

    Published 2009
    “…Diagonally Implicit Runge-Kutta (DIRK) methods are amongst the most useful and cost-effective methods for solving initial value problems but the dependency of the functions evaluations on the previous functions evaluations makes DIRK method not so favourable for parallel computers. …”
    Get full text
    Get full text
    Article
  17. 17

    Communication and computational cost on parallel algorithm of PDE elliptic type by Alias, Norma

    Published 2009
    “…Due to this needs, this paper presents the parallel performance evaluations of algorithms that will be discussed in term of communication and computational cost.…”
    Get full text
    Get full text
    Book Section
  18. 18
  19. 19

    Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil by Ahmad, Ahmad Firdaus

    Published 2014
    “…MR is an emerging parallel processing framework that hides the complex parallelization processes by employing the functional abstraction of "map and reduce" The Performance of the parallelized GA via MR and PSO via MR are evaluated using an analogous case study to find out the speedup and efficiency in order to measure the scalability of both proposed algorithms. …”
    Get full text
    Get full text
    Thesis
  20. 20