Sentence examples for minimal cover set from inspiring English sources

A minimal cover set C0={f,l}⊂R0 is constructed to cover all nodes in S0.

The time complexity of the collision-free schedule for sending nodes of minimal cover set is O N), due to removing the scheduled nodes.

Next, the sub-algorithm conducts collision-free scheduling by selecting a minimal cover set of each sending set, which is covered by the classified receiving set.

According to the property of the minimal cover set, each node u∈C i must have at least one proprietary neighbor v∈S i, which is only adjacent to u (line 10).

It takes at most O(Δ|R i |) time to construct the minimal cover set in each active time slot i. Considering all the active time slots, the time complexity is (Δ |R0|+|R1|+…+|Rτ−2|+|Rτ−1|))=O Δ|R|)=O ΔN).

We find the minimal inconsistency cover set is the minimal number of policies that represent a policy inconsistency.

Firstly, we reduce the complexity of reasoning about policy inconsistencies by static pruning technique and minimal inconsistency cover set.

We compute the minimal inconsistency cover set that is responsible for the policy inconsistencies; thus we only need to examine the minimum number of policies.

Thus we reduce the complexity of reasoning about policy inconsistencies by the techniques of static pruning and minimal inconsistency cover set.

Therefore, forms a mutually disjoint cover set with covers.

It means P 1 is the asymptotical minimal cover for problem (9).