We present a formulation, solution method, and program acceleration techniques for two dynamic control scenarios, both with the common goal of optimizing resource allocations. These approaches allocate resources in a non-myopic way, accounting for long-term impacts of current control decisions via nominal belief-state optimization (NBO). In both scenarios, the solution techniques are paralleliz...

Two new procedures for manipulating multiple stacks which share sequential memory locations are discussed. The first is the dynamic initial allocation procedure in which each stack is allocated as its first element arrives rather than having every stack preallocated at the very beginning of the entire process. The second is the local reallocation procedure; in this scheme, when a stack overflow...

The increasing pressure of competition in the dispatch trade in Germany requires a faster and more flexible adjustment of the systems to the customer's requests. Additional to questions of complexity, questions of flexibility and vitality are urging into the foreground. The paper presents instruments for the handling more integrated, at the same time however complexityreducing models of Neckerm...

When traac of connectionless best eeort protocols such as IP is carried over connection oriented protocols with guaranteed bandwidth, such as CBR connection in ATM, the interface layer between the protocols (i.e., AAL-the ATM Adaption Layer) need to specify the bandwidth requirement and the duration of the bandwidth reservation. The purpose of this paper is to develop policies for deciding and ...

This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem the Labeled Real-Time Dynamic Programming (lrtdp) approaches is applied in an effective way. lrtdp concentrates the planning on significant states of the environment only, as the search is guided by an initial heuristic. As demonstrated...

Available online 6 June 2009

In this work, we investigate the performance of distributed admission control with QoS provisioning and dynamical channel allocation for mobile/wireless networks. We first provide a QoS metric feasible for admission control with dynamically allocated channels. We then derive a criterion analytically using the QoS measure for distributed call admission cent rol with dynamic channel allocation. W...

In this work, we investigate the performance of distributed admission control with QoS provisioning and dynamical channel allocation for mobile/wireless networks. We first provide a QoS metric feasible for admission control with dynamically allocated channels. We then derive analytically a criterion using the QoS measure for distributed call admission control with dynamic channel allocation. Si...

Dynamic storage allocation is an important part of a large class of computer programs written in C and C High performance algorithms for dynamic storage allocation have been and will continue to be of considerable interest This paper presents detailed measurements of the cost of dynamic storage allocation in diverse C and C programs using ve very di erent dynamic storage allocation implementati...