Sentence examples for computation solutions from inspiring English sources

We compare the proposed algorithms to existing path computation solutions and present results that show that by considering these additional constraints, improvement is achieved in terms of reduction in request blocking probability, reduction in network costs and load distribution.

Therefore, when this subprotocol is used in any of the secure multiparty computation solutions from [7], all parties will locally generate the same sequence of random numbers, given a certain set of online users, thereby guaranteeing the same joint function output.

During computation, solution-based mesh adaptation is also applied so as to capture flow features more accurately.

Descretization and transfer of gauge field models to the lattice has always been seen as a problem of designing a digital computation solution.

We also show that each stage – remeshing, metric field computation, solution transfer, and flow solution – is important to design an efficient time-accurate anisotropic mesh adaptation process.

With symbolic computation, solution (36) with N = 0 and N = 1 has been verified by substituting them into (1).

The resulting operator entails subsidiary computations (solutions of pressure Poisson and convection diffusion subproblems) that are similar to those required for decoupled solution methods; however, in this case these solutions are applied as preconditioners to the coupled Oseen system.

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, are disclosed for reducing the impact of lighting conditions and biometric distortions, while providing a low-computation solution for reasonably effective (low threshold) face recognition.

Adleman's 1994 paper "Molecular Computation of Solutions to Combinatorial Problems" described the first successful example of DNA computing, in which he used DNA to solve a simple problem in graph theory involving a seven-node Hamiltonian circuit, an NP-complete problem (i.e., a problem for which no efficient solution algorithm is known) similar to the traveling salesman problem.

For a tractable computation of solutions to the optimization problems, we employ the semidefinite relaxation technique and identify the cases where this technique provides an optimal input signal.

The computation of solutions associated with the presence of moving bottlenecks is complex, since they both influence and are influenced by surrounding traffic.