Search Results - (( _ distribution ((drops algorithm) OR (tree algorithm)) ) OR ( rate adaptation a algorithm ))

Refine Results
  1. 1

    Fair bandwidth distribution marking and scheduling algorithm in network traffic classification by Al-Kharasani, Ameen Mohammed Abdulkarem

    Published 2019
    “…Therefore, in order to improve bandwidth fairness along with efficient optimization to alleviate this problem, we propose two marker algorithms; a Double Modified Double Improved time sliding window Three Colour Marker (M2I2TSWTCM) algorithm, which makes a new value of that depends on the logarithm peak information rate (PIR) and which is added to the adaptive factor that exists in the previous algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

    Efficient task scheduling strategies using symbiotic organisms search algorithm for cloud computing environment by Sa'ad, Suleiman

    Published 2022
    “…However, the efficiency of the clouds drops as the size of the search space gets larger, like in the case of most metaheuristic optimisation algorithms. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Accelerating learning performance of back propagation algorithm by using adaptive gain together with adaptive momentum and adaptive learning rate on classification problems by Abdul Hamid, Norhamreeza, Mohd Nawi, Nazri, Ghazali, Rozaida, Mohd Salleh, Mohd Najib

    Published 2011
    “…Over the years, many improvements and modifications of the back propagation learning algorithm have been reported. In this research, we propose a new modified back propagation learning algorithm by introducing adaptive gain together with adaptive momentum and adaptive learning rate into weight update process. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Exploring dynamic self-adaptive populations in differential evolution by Teo, Jason Tze Wi

    Published 2006
    “…In this paper, we present a first attempt at self-adapting the population size parameter in addition to self-adapting crossover and mutation rates. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Winsorize tree algorithm for handling outliers in classification problem by Ch’ng, Chee Keong

    Published 2016
    “…This study proposes a modified classification tree algorithm called Winsorize tree based on the distribution of classes in the training dataset. …”
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    OPTIMAL CABLE SELECTION IN RADIAL DISTRIBUTION NETWORKS CONSIDERING PLANNER'S DEFINED VOLTAGE DROP LIMIT by Ab Ghani, Mohd Ruddin

    Published 2002
    “…New computer algorithms are provided to determine the optimal cable size selection considering radial distribution networks and planner of power distribution defined allowable voltage drop all over the networks. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    The effect of adaptive parameters on the performance of back propagation by Abdul Hamid, Norhamreeza

    Published 2012
    “…Thus, this research proposed a new method known as Back Propagation Gradient Descent with Adaptive Gain, Adaptive Momentum and Adaptive Learning Rate (BPGD-AGAMAL) which modifies the existing Back Propagation Gradient Descent algorithm by adaptively changing the gain, momentum coefficient and learning rate. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Optimising neural network training efficiency through spectral parameter-based multiple adaptive learning rates by Yeong, Lin Koay, Hong, Seng Sim, Yong, Kheng Goh, Sing, Yee Chua, Wah, June Leong

    Published 2024
    “…The process of training neural networks heavily involves solving optimization problems. Most optimization algorithms use a !xed learning rate or a simpli!ed adaptive updating scheme in every iteration. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Dynamic characterized genetic algorithm for adaptive beam forming in WCDMA system by Kiong T.S., Ismail M., Hassan A.

    Published 2023
    “…In this paper, a modified Genetic Algorithm named as Dynamic Characterized Genetic Algorithm (DCGA) is proposed. …”
    Conference paper
  12. 12

    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
    “…In this paper, we develop a new version of ILMS algorithm, wherein in its adaptation step, only a random subset of the coordinates of update vector is available. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    RED, GRED, AGRED congestion control algorithms in heterogeneous traffic types by Seifaddini, Omid, Abdullah, Azizol, Vosough, Hamid

    Published 2013
    “…The performance metric used to show the analysis of these algorithms with mentioned distributions is Packet Loss (Pl).Results of simulation show that each algorithm performed a fair dropping of data packets without considering of their types.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

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

    Published 2015
    “…Empirical cumulative distribution function (CDF) model is presented in evaluating the real traffic distribution. …”
    Get full text
    Get full text
    Article
  15. 15

    A comparative study for parameter selection in online auctions by Gan, Kim Soon

    Published 2009
    “…In this work, three different models of genetic algorithms are considered. In the first model, the crossover and the mutation rate of the genetic algorithms are varied in order to create different combination of crossover and mutation rate. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Adapting And Hybridising Harmony Search With Metaheuristic Components For University Course Timetabling by Al-Betar, Mohammed Azmi

    Published 2010
    “…This dissertation presents a HSA adapted for UCTP. The adaptation involved modifying the HSA operators. …”
    Get full text
    Get full text
    Thesis
  17. 17

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

    Published 2015
    “…Empirical cumulative distribution function (CDF) model is presented in evaluating the real traffic distribution. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Adaptive resource allocation algorithms with QoS support in OFDMA-based WiMAX networks by Alsahag, Ali Mohamemed Mansor

    Published 2014
    “…The aim of this thesis is to develop a fair and effi- cient packet scheduling and adaptive multiuser frequency-time domain resources allocation algorithms to support QoS for a diverse service class in OFDMA based IEEE 802.16 network. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Red, gred, agred congestion control algorithms in heterogeneous traffic types by Seifaddini, Omid, Abdullah, Azizol, Vosough, Hamid

    Published 2013
    “…This paper presents an analysis of RED, GRED and AGRED algorithms with three different Traffic distributions which are Exponential distribution, Geometrical distribution and ON-OFF model using simulation. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    The Half-t adaptive error correction algorithm for SDH-based WDM optical networks by Cheah, Cheng Lai, Abdullah, Mohamad Khazani

    Published 2007
    “…Simulation results show that the Half-t algorithm can maintain the output bit error rate (BER) below a target BER by assigning an appropriate value of waiting delay before changing to a weaker code.…”
    Get full text
    Get full text
    Conference or Workshop Item