Search Results - dynamic bandwidth ((((extraction algorithm) OR (optimisation algorithm))) OR (selection algorithm))

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

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

    Published 2013
    “…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Adaptive resource allocation algorithms with QoS support based on network conditions using fuzzy logic system for IEEE 802.11n networks / Bakeel Hussein Naji Maqhat by Naji Maqhat, Bakeel Hussein

    Published 2016
    “…The second contribution is an efficient bandwidth allocation algorithm for A-MSDU aggregation called Adaptive Scheduling based Embedded Fuzzy (ASEF) system. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Design of ramp-time current control with dynamic fuzzy bandwidth for wireless power transmission by Leong, W.C., Mekhilef, Saad, Sulaiman, E., Krishnamurthi, M.

    Published 2016
    “…A fuzzy logic control algorithm was designed based on the structure of ramp-time current control in active power filters through simulation of ramp-time bandwidth variation to dynamically adjust the loop width of the ramp-time comparator. …”
    Get full text
    Get full text
    Article
  4. 4

    Adaptive resource allocation algorithms with QoS support based on network conditions using fuzzy logic system for IEEE 802.11n networks / Bakeel Hussein Naji Maqhat

    Published 2017
    “…The second contribution is an efficient bandwidth allocation algorithm for A-MSDU aggregation called Adaptive Scheduling based Embedded Fuzzy (ASEF) system. …”
    Get full text
    Get full text
    Book Section
  5. 5
  6. 6

    Load balancing and congestion control in ATM using fuzzy logic and spiking neuron network / Tan Jiann Shin by Tan, Jiann Shin

    Published 2005
    “…The proposed intelligent routing algorithm, integrates spiking neuron network with fuzzy link cost for the dynamic routing computation. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Partial Binary Tree Network (Pbtn): A New Dynamic Element Matching (Dem) Approach To Current Steering Digital Analog Converter (Dac) by Teh , Choon Yan

    Published 2014
    “…In this research, a new DEM algorithm is proposed on Current-Steering DACs with Partial Binary Tree Network (PBTN) algorithm to overcome glitches transitions with low complexity. …”
    Get full text
    Get full text
    Thesis
  8. 8

    A framework of rough cultural algorithms in optimizing mobile web caching performance by Sulaiman, Sarina, Shamsuddin, Siti Maryam, Abraham, Ajith, Sulaiman, Shahida

    Published 2007
    “…Hence, the goal of this study is to propose Rough Set (RS) as a knowledge representation for uncertainty in data of client behavior and mobile event specification with resource dependencies to reduce latency by prefetching selected resources to resolve the problems in handling dynamic web pages. …”
    Get full text
    Get full text
    Article
  9. 9

    Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems by Mansor, Nur Farraliza

    Published 2018
    “…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Enhancing the QoS performance for mobile station over LTE and WiMAX networks / Mhd Nour Hindia by Hindia, Mhd Nour

    Published 2015
    “…The selection is based on the user preferences since it uses a self-learning algorithm to determine triggers and handover thresholds dynamically. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network by Al-Kharasani, Nori Mohammed Abdulkarem

    Published 2020
    “…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Dynamic transmit antenna shuffling scheme for hybrid multiple-input multiple-output in layered architecture by Chong, Jin Hui

    Published 2010
    “…It is shown that the computational complexity of proposed FAST-QR detection algorithm is approximately 48 % lower than the conventional QR decomposition detection algorithm. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Adaptive energy efficient circular spinning protocol for dynamic cluster based UWSNs by Huma Hasan Rizvi, Sadiq Ali Khan, Rabia Noor Enam, Muhammad Naseem, Kashif Nisar, Danda B. Rawat

    Published 2022
    “…In this paper, a new Energy Efficient Circular Spinning (EECS) dynamic clustering algorithm has been proposed to provide an improved cluster setup system and to minimize energy usage in re-clustering or cluster setup. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    Void avoidance opportunistic routing density rank based for underwater sensor networks by Ismail, Nasarudin

    Published 2021
    “…However, the OR algorithm had also suffered from as higher traffic load for selection next forwarding nodes in the progression area, which suppressed the redundant forwarding packet and caused communication void. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Hybridflood algorithms minimizing redundant messages and maximizing efficiency of search in unstructured P2P networks by Barjini, Hassan

    Published 2012
    “…In the other word the algorithm improved unstructured P2P search's scalability, efficiency and reliability. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Hybrid harmony search-artificial intelligence models in credit scoring by Goh, Rui Ying

    Published 2019
    “…There are four main modifications of the MHS hybrid models i.e. elitism selection instead of random selection, dynamic exploration and exploitation operators following step functions instead of a static value, replacement of the bandwidth with coefficient of variations and two additional termination criteria included. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Reduced torque ripple and switching frequency using optimal DTC switching strategy for open-end winding induction machines by Abd Rahim, Muhd Khairi

    Published 2017
    “…The open-end winding induction machine is supplied by a dual-inverter which can offer a greater number of voltage vectors and hence, gives more options to select the most optimal voltage vectors to minimize the problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Efficient reconfigurable architectures for 3-D medical image compression by Ahmad, Afandi

    Published 2010
    “…These applications require continuous hardware servicing, and as a result dynamic partial recon�guration (DPR) has been introduced. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Efficient hybrid flooding scheme for ad-hoc on-demand distance vector routing protocol in MANET by Waheed, Bassam M.S.

    Published 2014
    “…Another prominent approach is the Dominant Pruning (DP) which is a distributed dominating set algorithm developed to alleviate the impact of flooding in mobile ad-hoc networks. …”
    Get full text
    Get full text
    Get full text
    Thesis