Time complexity of proposed evolutionary algorithm in artificial neural network
semanticscholar(2019)
摘要
The important issue in Evolutionary Algorithms (EAs)analysis, is time-complexity. Here to obtain the mean hitting time of EA the concept of take-overtime is considered. The time complexity of the EA such as the takeover time is considered, i.e.the concept of the takeover time is generalized rather thana selection of operator alone. This generalization is applied to benchmark problems like N-Bit parity. For various input sizes N, the time complexity in terms of number of generations is estimated. An empirical model is also generated for proposed EA using statistical tool.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要