$ and the norm $\|\cdot\|$. In this paper, we introduce hybrid algorithms for generating cyclic, non-expansive mapping of H. Also, we discuss about necessary and sufficient conditions on subsets of Hilbert space to be remotal or uniquely remotal. Moreover, we give the basic concepts and theorems of farthest points of Bounded subsets of H. In the end, we will provide examples to illustrate our results.]]>
0$.]]>
M\). Furthermore, we employ N-policy and first excess level analysis to derive the probability generating function of queue size. Additionally, we assume that the vacation times are exponentially distributed random variables, and arrival batches are type 1 geometrically distributed random variables.]]>
0$]]>
0\) function. We interpret and study the uniform convergence of the modern operators to \(\text{\ f}\). Also, by analyzing the asymptotic conduct of our operator.]]>