For a small value of, for example,, the execution time is proportional to at most.
For this example, the execution time of each fixed-point simulation is equal to 480 seconds.
For example, the execution time for the OFDCNI scheme with five POD bases was only 8 seconds at (t=2), while that of the classical FDCN scheme was 96 seconds in the same PC, but the errors of both solutions did not exceed (O(10^{-4})), which also shows that the numerical computational results were in line with the theoretical ones.
For example, the execution time by BfsEnumP3 with division depth d = 8 for C10N3O2H25 was longer than those by BfsEnumP1-2 (see Figure 2(c)).
For example, the execution time of the sequential implementation of STAUCC for the 256-compartment system can vary between 43.73 seconds for 6,244 iterations (wall clock time) and 2,214.23 seconds for 427,156 iterations.
The experimental results show the validity of the implemented solution, as it significantly reduces (in one of the examples the execution time decreases from 2 h 38 min to only 3 min) the final execution time of the entire process.
The VNS algorithm executes until a certain halting condition is reached, for example, when the execution time exceeds some limit.
Indeed, a high number of evaluated levels per negative example will bring a high execution time.
For example, Figure 15 presents the execution time of the hardware scheduler (in cycles) according to the number of software tasks.
For this example, the analytical approach reduces the execution time by a factor 63.
