The Vertex Coloring Problem consists in, for a given a graph (G), determining (chi (G)).
The indicator consists then for a given sensor and source to compute all the possible TDOA sets and choose the one that minimizes the variance of { O i, j k, l, k ∈ [ 1, ⋯, P ] } l∈ [1,…,j−1,…,N]…,…,N]
The Weighted Coloring Problem [7] consists in, for a given graph (G) with non-negatives real weights associated to its vertices, determining the minimum weight of a proper coloring of (G), that is, the weighted chromatic number of (G), denoted by (chi _w(G)): begin{aligned} chi _w(G) = min _{c mathrm{coloring,of} G} w(c).
The optimization consists of finding, for a given fuel cell load, an optimum set of values of the 7 fuel cell operating parameters: the fuel cell temperature, the reactants' stoichiometric ratios, the reactants' inlet relative humidity, and the reactants' outlet pressures, resulting in the highest fuel cell performance.
The second set of covariates consists of SNPs for a given set of interest, such as those SNPs belonging to a gene.
Given two strings S1 and S2, each one with length N and M, and a long sequence of position pairs, the longest common extension (LCE) problem consists in finding, for a given query pair (i, j), the length of the longest prefix of S1[ i..] that matches a prefix of S2[ j..].
aLRTs provide a fast way of testing branch support and consist in comparing, for a given branch, the likelihoods of the best tree containing the branch (i.e. the current supertree) and the best tree not containing the branch (keeping the rest of the topology identical).
It consists of scanning many ports for a given destination.
Another such example was presented by Mierswa and Morik [25], where method trees consisting of ad hoc features for a given audio signal were introduced.
Method 1 consisted of selecting the slice for a given tumour where a mensuration of diameter could be performed according to RECIST or WHO methods and subsequent manual contouring of the tumour on this slice in 2D.
