P i and R i are evaluated using 10-fold cross validation.
The kernels K i are evaluated at the model grid knots by integrating over the neighboring integration-grid knots.
Each candidate solution v i is evaluated, and then compared with x i.
GWshallow(i) is evaluated as: GW shallow i = GW shallow i − 1 + BCM rch i – shallowflow i − deepflow i (3).
GWsurface(i) is evaluated as: GW surface i = GW surface i − 1 + BCM run i – Surfaceflow i − 1 (1).
The tolerance (epsilon_{x}) represents the trust region of the last evaluation point (hat{x}_{i}) and (hat{x}_{c}^{(i)}) where partition i was evaluated.
To analyze the overall complexity we need to compute how many times the same location i is evaluated.
The location i is evaluated again for some w ¯, and inserted into the list L w ¯, only if Γ[ i] is false and Γ[ i + | w|−1] is true.
In the next step, anticipatory update FIMs for all candidate experiments i = 1,..., nϵ and j = 1,..., n y i are evaluated at the current MLE.
