Sentence examples for algorithm lines from inspiring English sources

Thus, this is the output of the algorithm (lines 9 and 10).

In this algorithm, lines 4 34 represent the first stage of QA-learning while lines 35 53 represent the second stage of QA-learning.

The last phase of the algorithm (lines 9 17) uses the cumulative laxity values to calculate and assign a sub-deadline for each of job j's tasks.

This ensures that the learning part of the algorithm (lines (5)–(7)) leads to proper parameter updates, whereas the steering part (line (3)) does not suffer from sudden changes in the perceived sounds due to a parameter update.

We divide the proof into two parts: If K 1 ( 1 ) = ρ h 11 h 11 H ∥ h 11 ∥ 2 for some ρ ∈ ℝ (i.e. it corresponds to the MRT beamformer to receiver 1), then trivially K ̂ 1 ( 1 ) = K 1 ( 1 ) as this is the initial guess of the algorithm (lines 7 and 8) and it satisfies α log I + H t H K ̂ 1 ( 1 ) H t ≥ R 1 ⋆.

The second measure compares the execution of the entire algorithm (lines 3 through 20), including the parts that were not considered for GPU offload.

The session reconstruction algorithm starts from the initial state of the algorithm (line 7).

These frames will produce the same value of J f (Algorithm ??, line 7).

As it can be seen in the algorithm (line 35), we use an exponential weighted moving average (EWMA) to estimate the average delay.

In Algorithm ??, line 8, a coefficient λ is computed based on the weight w r of the recommendation and a constant L c.

In this work two new algorithms (line of sight and closest cell) are proposed which do not need F2C.