Sentence examples for minimum MCs problem from inspiring English sources

In this paper, we investigate the minimum MCs problem (MinMCP) for two-dimensional (2D) wireless rechargeable sensor networks (WRSNs), i.e., how to find the minimum number of energy-constrained MCs and design their recharging routes in a 2D WRSN such that each sensor node in the network maintains continuous work, assuming that the energy consumption rate for all sensor nodes are identical.

The composting material should have bare minimum MC for the survival of microorganisms, whereas the rate of oxygen diffusion of the pores decreases when MC is high.

This paper proposes a new method to solve the d-MC problem.

Dealing with MC problems as a problem well suited for pattern recognition algorithms goes before the work in [9].

In this section, we analyze the model from inner minimum problem to outer minimum problem.

Much of our problem is not a minimum wage problem.

Consequently, based on these link weight assignments, the MC-NSRLG problem in Fig. 8 can be reduced to the SP-SRLG problem in Fig. 7, similar to the proof of the MCDCM problem in "Minimum cuts in correlated networks" section.

In general, the MC-NSRLG problem is still NP-hard.

Fig. 8 NP-hardness of the MC-NSRLG problem.

Also the min-cut under the SRLG-like correlated model (MC-SRLG) problem is NP-hard.

Potential nucleotide variants should be greater than the sequence quality value (QV), neighbour quality value (NQV), minimum coverage (MC), and minimum minor allele frequency (MMAF).