The procedure returns the vector ( overrightarrow{mathrm{nptx}} ).
The detectCorner procedure returns a table indicating the obstacles' distances at "front", "right" and "left".
So, this procedure returns a good approximation of, on the evaluation set, of degree less than ; (iii) the procedure returns an integer from the set given as a parameter.
If the node is a left child, its membership degree is calculated through ; otherwise, the procedure returns, in which m is the parent node.
If (varepsilon >bar{varepsilon }), then the sampling intervals are randomly selected and modified by several millimeters, and the procedure returns to Step 4.2 (1).
In the above algorithm, the getCID procedure returns the highest possible CID option that can be allocated to node i with fairness ratio equal to ρi.
The alignment procedure returns a best finishing time, FT, of the schedule which is either 'good enough' or a reasonable one.
If no candidates of (f_{H_j}) remain, then the procedure returns to Step 2 and modifies the target line by reducing its curvature.
In response, Yoshimura et al. (1982) improved the model with a stepwise regressive procedure, returning the complex final system to a low-level nonlinear system, thereby increasing its applicability.
Given a set S, the branching procedure returns non-overlapping subsets S1, S2,..., whose union is the set S. The bounding function then computes the upper and/or lower bounds of the optimal value given each subset S i.
n.f i n g e r[ k], then repeats the operation recursively, until the procedure returns the node (n^{-1}_{textit {key}}) preceding the key on the key ring.
