The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper studies the time complexity of gene expression programming based on maintaining elitist (ME-GEP). Using the theory of Markov chain and the technique of artificial fitness level, the properties of transition matrices of ME-GEP are analyzed. Based on the properties, the upper and lower bounds of the average time complexity of ME-GEP are obtained. Furthermore, the upper bound is estimated,...
Through the analysis of uncertainties of the durations, costs and rewards as well as the characteristic of frequent repairing in the mould and die manufacturing project, this paper proposed a stochastic evolution model of multiple mould and die manufacturing projects, which was on the basis of a discrete time Markov chain. With the aim to overcome the ‘curse of dimensionality’, an algorithm framework...
This paper studies the convergence rates of gene expression programming based on maintaining elitist (ME-GEP) by means of Markov chain and spectrum analysis. We obtain the following results: (1) ME-GEP algorithm converges to the global optimum in probability. (2) The convergence rates of ME-GEP algorithm depend on the revised spectral radius of transition matrix of Markov chain corresponding to the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.