(i) In line 5, there is no need to test each instance provisioning policy in [MIN_NUM, MAX_NUM]. Instead, we can use either approach listed as follows. (1) Define a positive integer variable stepsize which is greater than 1, and increase by stepsize rather than 1. (2) Pick a small set of randomly from [MIN_NUM, MAX_NUM]. (ii) Compute and using (13) and (15) after line 19. (iii) The output of the algorithm is func_app[].
(i) The input of the algorithm is func_app[]. (ii) The exhausted search approach (lines 2–7) is replaced by the inverse functions of (8) and (9) as follows. (1) For linear approximation case, . (2) For nonlinear approximation case, , where [] is the smallest integer no less than .