Algorithm 2. Elite Mapping Swotting Algorithm for Parameter Mapping

Prerequisites: present state cs(t), previous state ps(x), and F(t) Ascertain that the Swotting algorithm selected produces the maximum possible output. OP Training: given the state of the network cs(t); Probabilistic exploration $\mathsf{\gamma }$; Choose one action at random; New Update $\mathrm{UP}(\mathrm{t})=\left\{\mathrm{b}|\mathrm{W}\left(\mathrm{cs}\left(\mathrm{t}\right),\mathrm{b}\right)=1\right\}$ for cs(t); Probabilistic Exploitation is 1 −$\mathsf{\gamma }$; Choose $\mathsf{\alpha }$ records UP”(CS’(ps(x),F(t)) from actions F in accordance with CS’(ps(x),F(t)) Resolve Re(cs(t), r) in accordance with next r(x) and fill UPR(cs(t)); if $(\mathrm{y}* \mathrm{exist}={\max }_{\mathrm{y}}(\mathrm{y}\left|\mathrm{cs}\right(\mathrm{y}) \in$ UP”(CS’(cs(t)),F(t)) $\cap$ UP’(cs(t)) then Choose the action r(x); Else if Choose action from UPR(cs(t)); end if do update UP(cs(t), r) do repeat SWQ; while (t = t + 1 and s = s.t + 1)