In many application environments there is a need to able to allocate resources dynamically. The occam programming language has no concept of such dynamic allocation. This paper shows how dynamic allocation can be incorporated into occam without sacrificing the benefits which are obtained using static allocation strategies. This capability has been achieved by a simple extension to occam3 to inc...

this research uses a comprehensive method to solve a combinatorial problem of distribution network expansion planning (dnep) problem. the proposed multi-objective scheme aims to improve power system's accountability and system performance parameters, simultaneously, in the lowest possible costs. the dynamic programming approach is implemented in order to find the optimal sizing, siting and...

In this paper we introduce a method for dynamic channel allocation in CDMA networks. In contrast to other approaches in the literature we try to meet the application demands only with a high confidence, but not exactly. This is possible because of the features of multicode CDMA and the used internet protocol mechanisms. We show a computationally simplified solution to solve the problem of quick...