Why Estimation Algorithm of First Passage Time Transition Probabilities Concerns Genetic Algorithms Without Bit Mutation?
Concerning genetic algorithm without bit mutation such as absorbing Markov Chain, our aim is proposition modern algorithm to secure experiential and impractical results concerning first passage time transition probabilities estimation with regard to transient states.
El-Nady Kh., Abou El-Enien U., Badr A. (2011). Why are genetic algorithms MCMC2 Markov Chain Monte Carlo. AMSE Journals, Advances in Modelling and Analysis B 54(1): 1-16.
Abou El-Enien U. (2015). Why unified statistics theory by MCMC towards estimation of stationary transition probabilities of stochastic matrix?. Journal of Computer and Mathematical Sciences 6(7): 411-415.
Abou El-Enien U. (2019). Why the estimation method of recurrence time transition probabilities with regard to genetic algorithms without bit mutation?. Computer Reviews Journal (accepted).
Abou El-Enien U. (2012). A new unified MCMC methods toward unified statistics theory by MCMC. LAP, Germany.
Copyright (c) 2019 Usama Hanafy Abou El-Enien
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain the copyright of their manuscripts, and all Open Access articles are distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided that the original work is properly cited.
Computer Reviews Journal allows the author(s) to retain publishing rights without restrictions.
This Journal is licensed under a Creative Commons Attribution 4.0 International License.