In this paper, a novel approach for solving the `Water- filling problem with peak power constraints for individual resources' also known as Cave-Filling Problem (CFP) is proposed. The proposed algorithm calculates a lower bound for the number of resources that are assigned positive powers, K, and then calculates the K powers only once. This lowers the total computational cost of the proposed algorithm significantly. Simulation results validate the proposed algorithm.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fast Algorithm for Solving Cave-Filling Problems


    Contributors:


    Publication date :

    2016-09-01


    Size :

    236489 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Face Stability Assessment for Karst Tunnelling across a Filling-type Karst Cave

    Xiao, Qianfeng / Li, Yajing / Xue, Peng et al. | Springer Verlag | 2024


    Face Stability Assessment for Karst Tunnelling across a Filling-type Karst Cave

    Xiao, Qianfeng / Li, Yajing / Xue, Peng et al. | Springer Verlag | 2024


    Beardmore engines, cave-brown-cave

    Engineering Index Backfile | 1928


    Fast Iterative Algorithm for Solving Moser–Veselov Equation

    Luo, Jinglin / Yan, Guirong | AIAA | 2015


    Fast Algorithms for Solving H-infinity-Norm Minimization Problems

    Varga, Andras / Parrilo, Pablo | German Aerospace Center (DLR) | 2001

    Free access