Sentence examples for feasibility of finding from inspiring English sources

"Kepler changed our collective perspective regarding the feasibility of finding evidence of life beyond Earth and catalyzed efforts across the globe to reach that goal," said Batalha, project scientist for the Kepler mission.

More importantly, these compact IGRs allow us to assess the feasibility of finding regulatory sequences with an exhaustive scan of the non-coding segment of the genome, and in the absence of comprehensive gene expression data.

As mentioned, the feasibility of finding a small molecule that specifically targets protein protein interactions is very much case dependent 38), but identifying the crucial site improved our ability to hone in on high-affinity, small-molecule binders targeting either binding partner.

While finding specific inhibitors to target each viral threat individually may be ideal, the cost-savings and feasibility of finding drugs that act as broad-spectrum antivirals, or those that target specific viral genus or family, is an important goal given the expense associated with developing any one drug for one disease.

As a reader and reviewer, I wonder about the logic and feasibility of finding a middle ground when faced with the prospect of reaching a tipping point with respect to climate change long before the necessary technological advances and sociopolitical will for behavioral change arrive.

To test the feasibility of finding cDNA sequences derived from inserted GMO cassettes in a transcript libraries prepared from other plant species, we searched the National Center for Biotechnology Information (NCBI) EST database for sequence collections derived from genetically modified plants.

For example, if the nonexpansive operators are projection onto some closed convex sets C i ( i ∈ N ) in a real Hilbert space H, then such a fixed point problem becomes the convex feasibility problem of finding a point in ⋂ i ∈ N C i.

The convex feasibility problem (CFP) of finding a point in the nonempty intersection is considered, where is an integer and the 's are assumed to be convex closed subsets of a Banach space.

The convex feasibility problem (CFP) of finding a point in the nonempty intersection is considered, where r ≥ 1 is an integer and each C m is assumed to be the solution set of a generalized variational inequality.

The convex feasibility problem (CFP) of finding a point in the nonempty intersection is considered, where is an integer and each is assumed to be the fixed point set of a nonexpansive mapping, where is a reflexive Banach space with a weakly sequentially continuous duality mapping.

If (F = G = phi = varphi = T = S =0), (B = I), and (H_{2} = H_{3}), then problem (1.4) is reduced to the split feasibility problem (SFP) of finding (x^ in C) such that A x^ in Q. (1.11) This problem was introduced by Censor and Elfving [6].  .