Sentence examples for weight assignment of from inspiring English sources

When was the last time a horse raced in North America with a weight assignment of 135 pounds?

The procedure to implement GGE for supervised and unsupervised configurations is summarized in Algorithm 1. Graph relations play a crucial role in the GE framework to determine how the methods behave based on the connectivity and weight assignment of the neighboring points in the data.

Since the routing metric of a path is the same as the aggregated link weight of the corresponding virtual links and the weight assignments of the virtual links are isotonic, efficient algorithms can find minimum weight paths.

Weight assignment: The weight of each edge is related to the spatial locations of the vertices as shown in Eq. (4).

This method of weight assignment is most intuitive when considering the fact that one of the aims is to reduce the effects of phylogeny on the results of the GCPV method.

As a consequence of weight assignment, the environmental aspect is the most important aspect in the view of the experts.

(1) Excessive allocation: as static weight assignment schemes are unaware of the current network conditions, in the case of excessive allocation, a node is given transmission opportunities typically at the cost of suppressing other nodes even if it has no packets to transmit.

In contrast to the subjective approach, the objective weighting-based methods provide flexibility in weight assignment depending on the variation of the local system.

Results (Fig. 7) revealed that the top part of the ranking is very stable; the tract with ID 401 (the first tract 01 in the fourth sector 4) ranked first, and maintained this position regardless of weight assignment or input data uncertainties.

The goal is to find a weight assignment w="{wv:v∈V} of minimum total weight w(V)="∑v∈Vwv, such that in the activated graph Gw="(V,Ew), where Ew="{uv:fuv(wu,wv)="1}, the following holds: for each uv∈R, the activated graph Gw contains r uv) pairwise edge-disjoint uv-paths such that no two of them have a node in S∖{u,v} in common.

This priority is achieved through weight assignment and modifying the scheduling decision making algorithm of CAPS.