Why Estimation Algorithm of First Passage Time Transition Probabilities Concerns Genetic Algorithms Without Bit Mutation?

  • Usama Hanafy Abou El-Enien The High Institute for Tourism, Hotels & Computer, El-Seyouf, Alexandria
Keywords: Genetic Algorithms without Bit Mutation, First Passage Time

Abstract

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.     

Downloads

Download data is not yet available.

Author Biography

Usama Hanafy Abou El-Enien, The High Institute for Tourism, Hotels & Computer, El-Seyouf, Alexandria

Administrative Information Systems Department, The High Institute for Tourism, Hotels & Computer, El-Seyouf, Alexandria, Egypt

References

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.

Published
2019-08-30
How to Cite
Abou El-Enien, U. H. (2019). Why Estimation Algorithm of First Passage Time Transition Probabilities Concerns Genetic Algorithms Without Bit Mutation? . Computer Reviews Journal, 4, 146-148. Retrieved from http://purkh.com/index.php/tocomp/article/view/507
Section
Research Articles