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.
Fast Algorithm for Solving Cave-Filling Problems
2016-09-01
236489 byte
Conference paper
Electronic Resource
English
Face Stability Assessment for Karst Tunnelling across a Filling-type Karst Cave
Springer Verlag | 2024
|Face Stability Assessment for Karst Tunnelling across a Filling-type Karst Cave
Springer Verlag | 2024
|Beardmore engines, cave-brown-cave
Engineering Index Backfile | 1928
Fast Algorithms for Solving H-infinity-Norm Minimization Problems
German Aerospace Center (DLR) | 2001
|