Sentence examples for path solutions from inspiring English sources

In particular, penalizing routes with either steep slopes in the direction of the trajectory or high cross-slopes yields to optimal routes that depart from traditional shortest path solutions.

Moreover in previous studies, DNA molecular operations usually were used to solve NP-complete head-to-tail path search problems, rarely for NP-hard problems with multi-lateral path solutions result, such as the minimum spanning tree problem.

Since the last stage here is to minimize the number of reactions, we can enumerate path solutions in ascending (staged) objective value order, so first find the CFP that best minimizes our three-stage objective; then the next best solution; then the next best solution; etc.

This observation is consistent with the ability of EEEP to recover edit path solutions for very large protein trees with > 10 edits, due to partitioning of the tree into multiple regions of discordance, while randomly permuted trees of a similar size often could not be resolved.

Consequently, we performed comparisons between many pairs of random trees to generate a background distribution of edit distances between trees, and concentrated on trees with 15 or fewer taxa, in a range where EEEP was able to recover edit path solutions for every protein tree tested above.

which imply that satisfies (3.76), that is, is a sample path solution of (3.76).

For each sample, we produce a sample path solution to the SDE on ([t_{0},T]).

Let be any sample path solution of (3.76); then Lemma 3.39 implies (3.87).

If is a sample path solution of (3.76), then it is easy to check that is a solution of (3.81).

The deployment of the shortest path solution has not been able to prolong the network lifetime [1].

We study large deviation estimates of its path solution and our approach for verifying the large deviation principle is based on the weak convergence arguments.