Sentence examples for with minimum network from inspiring English sources

In this paper, we mathematically formulated the resource reallocation problem as an optimization problem with minimum network reconfiguration overhead subject to QoS requirements of the applications' flows.

Provision is made in the communications system to make "live" connections, permitting the removal or addition of nodes with minimum network interruption.

It is however a challenging task to implement a high performance collaborative surgical simulation system because of the difficulty in maintaining state consistency with minimum network latencies, especially when sophisticated deformable models and haptics are involved.

Following the DCLS algorithm, a distributed and cooperative power control (DCPC) algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power.

In particular, we explain how the virtual-to-physical address translation is implemented efficiently with a minimum Network Interface Card (NIC) memory requirement.

Based on this result, we propose a deployment strategy with T as the required minimum network lifetime.

However, these solutions are mostly concerned with providing means for route discovery with minimum extra network load and, therefore, do not take into account the highly dynamic environment present on roads, neither exploit specific characteristics of vehicular networks such as the predictable mobility pattern of vehicles' movements.

However, the minimum network is less robust against parameter variations than the original network with nested feedback loops.

The developed model was employed on an urban and an industrial facility to demonstrate the effectiveness of proposed model to solve the minimum water network with minimum storage tank capacity and network inter-connections.

In To and Habib (2009), the authors describe an algorithm that can compute the level- k network with minimum number of reticulations (if such a network exists), for every fixed k in polynomial time.

In this paper, we proposed an efficient greedy heuristic for identifying critical vertices in networks whose removal leaves the residual network with minimum pairwise connectivity.