（1+1）-进化算法的概率分析
Probabilistic analysis of the (1+1)-evolutionary algorithm
摘要：
对（1+1）-进化算法的代价进行了详细的分析。这个问题已经接近进化算法文献下的各种观点，制定和严格程度。我们的平均值和方差的渐近近似代表他们的同类最强。我们开发的方法也适用于表征的极限法，是基于基本的复发渐近解决方案。虽然大多数近似都具有简单的形式本质，但我们详细说明了严格证明所需的微妙的误差分析。
英文摘要：
We give a detailed analysis of the cost used by the (1+1)-evolutionary algorithm. The problem has been approached in the evolutionary algorithm literature under various views, formulation and degree of rigor. Our asymptotic approximations for the mean and the variance represent the strongest of their kind. The approach we develop is also applicable to characterize the limit laws and is based on asymptotic resolution of the underlying recurrence. While most approximations have their simple formal nature, we elaborate on the delicate error analysis required for rigorous justifications.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
