The first phase of the algorithm was considered in the simultaneous polling method in [7].
This phase of the algorithm is based on the pivot selection of [23].
The second phase of the algorithm collapses parallel structures (lines 12 28).
The chemotaxis phase in BFA was designed such that it represents exploration stage and placed at the first phase of the algorithm, while the ASDA as the exploitation stage and was placed at the second phase of the algorithm.
The set of the groups obtained by the first phase of the algorithm is denoted by for.
The Use feedback and Check functions realize the training and the change detection phases of the algorithm, respectively.
The phases of the algorithm can be repeated, as collapsing parallel structures may lead to new sequential structures.
We characterize the various phases of the algorithm that help us to develop a theoretical framework required for analysis.
The two main phases of the algorithm are the Estimation phase (see Section "Estimation analysis") and the Update Weights phase (see Section "Updating weights").
In addition, a cache miss triggers the eviction phase of the algorithm if the requested object does not fit in the available free space.
After the initialization phase of the algorithm, where the particle randomization is performed, the particles are evaluated and moved iteratively in the search space.
