Sentence examples for a given set of nodes from inspiring English sources

A Voronoi diagram represents the region of influence around each of a given set of nodes.

For a given set of nodes having fixed SNRs, exploiting (18) leads to the following theorem.

The Voronoi partition or cluster for a given set of nodes is unique and produces polygons which are route connected.

A buyer procures a network to span a given set of nodes; each seller bids to supply certain edges, then the buyer purchases a minimal cost spanning tree.

The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane.

First of all, the MWS concept used by Helbing et al. fundamentally has same function as the ideal MST structure that was argued by Goldstone et al., as both terms discuss the same notion: the minimum total interconnect for a given set of nodes.

In a given network and for a given set of node pairs (zeta), the forbidden pairs shortest path problem looks for the shortest path between s and t such that at most one node from each pair in the set (zeta) lies on this path.

We address this design problem minimizing the impact of a given set of critical nodes.

With Shape Aware Quadratures (SAQ), for a given set of quadrature nodes, order, and domain of integration, the quadrature weights are obtained by solving a system of suitable moment fitting equations in least square sense.

Our design proposal consists of jointly deciding on (i) the number and placement of proxy servers on a given set of potential nodes, (ii) replicating content on the proxy servers, and (iii) routing the requests for the content to a suitable proxy server such that the total cost of distribution is minimized.

Theorem 2. For a given set of forwarding nodes whose corresponding is, respectively, is minimized with respect to if and only if the are ordered in an increasing order such that the higher priority is given to the node with the smaller.