期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A Tentative Research on Complexity of Automatic Programming 被引量:18
1
作者 Kang Li\|shan, Li Yan, Chen Yu\|ping Computation Center, State Key Laboratory of Software Engineering,Wuhan University,Wuhan 430072,China 《Wuhan University Journal of Natural Sciences》 CAS 2001年第Z1期59-62,共4页
In this paper, based on the following theoretical framework: Evolutionary Algorithms + Program Structures = Automatic Programming , some results on complexity of automatic programming for function modeling is given, w... In this paper, based on the following theoretical framework: Evolutionary Algorithms + Program Structures = Automatic Programming , some results on complexity of automatic programming for function modeling is given, which show that the complexity of automatic programming is an exponential function of the problem dimension N , the size of operator set |F| and the height of the program parse tree H . Following this results, the difficulties of automatic programming are discussed. Some function models discovered automatically from database by evolutionary modeling method are given, too. 展开更多
关键词 evolutionary algorithms complexity of automatic programming program structures
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部