Sentence examples for path such that from inspiring English sources
Other simulations were performed in order to optimize the scintillator depth (length along the neutron path) such that the best ratio of direct to scattered neutron counts is achieved.
We first determine the necessary and sufficient conditions for the existence of a path such that our system is able to maintain one given landmark visibility in the presence of obstacles.
Then, similarly to the work of Reeds and Shepp, we introduce a set of path types that contains the type of any subpath of a shortest path such that all contacts with obstacles are avoided, except possibly at the endpoints of the subpath.
The RMCPR consists of finding a path from a source to a destination, and locating relays on some nodes of the path, such that the total cost of setting arcs and relays is minimized, and for each resource, the total consumption between the source and the first relay, any two consecutive relays, and the last relay and the destination do not exceed a predefined upper bound of resource consumption.
We have to show that which is fulfilled if there exists a path such that (5.4).
This is no small thing for me, as my life has evolved by unforeseen paths such that I see more of this abuelita than of any other human being.
More precisely, given traffic demands to be routed in a network, the design problem is to define a collection of light paths such that each demand can follow a sequence of consecutive light paths.
The informants valued the "mystery" that they felt was part of the landscape and which consisted of layered elements such as fences, gates, and paths, such that these features (including buildings) had to be "discovered".
More specifically, a balanced RF frond-end circuit is designed to allow a signal to propagate through symmetrical paths such that: (1) transmit signals taking different paths to arrive at the receiver can be cancelled; (2) receive signals from different paths are simply added at the receiver.
The goal is to find a weight assignment w="{wv:v∈V} of minimum total weight w(V)="∑v∈Vwv, such that in the activated graph Gw="(V,Ew), where Ew="{uv:fuv(wu,wv)="1}, the following holds: for each uv∈R, the activated graph Gw contains r uv) pairwise edge-disjoint uv-paths such that no two of them have a node in S∖{u,v} in common.
