更改

==相关算法==

==相关算法==

*[[交互Metropolis–Hasting算法]](又名顺序蒙特卡罗算法)<ref name=":3">{{Cite journal|title = Sequential Monte Carlo samplers - P. Del Moral - A. Doucet - A. Jasra - 2006 - Journal of the Royal Statistical Society: Series B (Statistical Methodology) - Wiley Online Library| doi=10.1111/j.1467-9868.2006.00553.x|volume=68| issue=3|journal=Journal of the Royal Statistical Society, Series B|pages=411–436|arxiv=cond-mat/0212648|year = 2006|last1 = Del Moral|first1 = Pierre| last2=Doucet| first2=Arnaud| last3=Jasra| first3=Ajay}}</ref>)结合模拟退火算法，采用交互循环机制，对最适合的个体进行接受-拒绝。

*[[交互Metropolis–Hasting算法]](又名顺序蒙特卡罗算法)<ref name=":3">{{Cite journal|title = Sequential Monte Carlo samplers - P. Del Moral - A. Doucet - A. Jasra - 2006 - Journal of the Royal Statistical Society: Series B (Statistical Methodology) - Wiley Online Library| doi=10.1111/j.1467-9868.2006.00553.x|volume=68| issue=3|journal=Journal of the Royal Statistical Society, Series B|pages=411–436|arxiv=cond-mat/0212648|year = 2006|last1 = Del Moral|first1 = Pierre| last2=Doucet| first2=Arnaud| last3=Jasra| first3=Ajay}}</ref>结合模拟退火算法，采用交互循环机制，对最适合的个体进行接受-拒绝。

*[[量子退火 Quantum annealing]]使用“量子涨落 quantum fluctuations”而不是热涨落来穿过目标函数中高而薄的屏障。

*[[量子退火 Quantum annealing]]使用“量子涨落 quantum fluctuations”而不是热涨落来穿过目标函数中高而薄的屏障。