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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Fast Algorithm for Solving Cave-Filling Problems


    Beteiligte:


    Erscheinungsdatum :

    01.09.2016


    Format / Umfang :

    236489 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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 Algorithms for Solving H-infinity-Norm Minimization Problems

    Varga, Andras / Parrilo, Pablo | Deutsches Zentrum für Luft- und Raumfahrt (DLR) | 2001

    Freier Zugriff

    Fast Iterative Algorithm for Solving Moser–Veselov Equation

    Luo, Jinglin / Yan, Guirong | AIAA | 2015