期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Optimized quantum random-walk search algorithm for multi-solution search 被引量:1
1
作者 张宇超 鲍皖苏 +1 位作者 汪翔 付向群 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第11期133-139,共7页
This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the se... This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value. 展开更多
关键词 quantum search algorithm quantum random walk multi-solution abstract search algorithm
下载PDF
The Convergence of the Abstract Evolutionary Algorithm Based on a Special Selection Mechanism
2
作者 BIYong-qing XUEMing-zhi 《Chinese Quarterly Journal of Mathematics》 CSCD 2003年第2期213-220,共8页
There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model colled the abstract evolutionary algorithm. In this paper, we... There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model colled the abstract evolutionary algorithm. In this paper, we first introduce the definitions of the abhstract selection and evolution operators, and that of the abstract evolutionary algorithm, which describes the evolution as an abstract stochastic process composed of these two fundamental abstract operators. In particular, a kind of abstract evolutionary algorithms based on a special selection mechansim is discussed. According to the sorting for the state space, the properties of the single step transition matrix for the algorithm are anaylzed. In the end, we prove that the limit probability distribution of the Markov chains exists. The present work provides a big step toward the establishment of a unified theory of evolutionary computation. 展开更多
关键词 abstract evolutionary algorithm a transition matrix CONVERGENCE
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部