Why Estimation Method of Recurrence Time Transition Probabilities with Regard to Genetic Algorithms Without Bit Mutation?
Journal Title: Computer Reviews Journal - Year 2019, Vol 4, Issue 0
Abstract
Respecting genetic algorithms without bit mutation, our study is to submit unprecedented algorithm to procure tentative and notional results respecting recurrence time transition probabilities estimation for transient states.
Authors and Affiliations
Usama Hanafy Abou El-Enien
Keywords
Related Articles
- EP ID EP655252
- DOI -
- Views 144
- Downloads 0
Designing a Customer Relationship Management System in Online Business
With the advancement of online shopping technology, it has become the first choice for most consumers. The activity of online stores in this competitive business space should be in line with the expectations of their cus...
Application of Multi Objective Genetic Algorithm for Optimization of Core Configuration Design of a Fast Breeder Reactor
The optimization problem of nuclear fuel management, reported in the present study aimed at arriving at the optimal number of subassemblies in the two fuel enrichment zones of the core of a 500 MWe Fast Breeder Rea...
A Theoretical Overview of Mobile Networks Environment in Ecuador Prior To 5G
Many countries in the Latin American region experience the technology gap when new technologies are either developing or in testing scenarios. Telecommunications services provider must be encouraged, allowing universal a...
Search Engine Optimization with Google Search Console
This paper is based on how Google search engine optimization effectively works. And the visibility and quality content of the search engine index page. The keyword feature targeted in this paper is to follow Google quali...
A General Study on Langevin Equations of Arbitrary Order
In this paper, the broad study depends on Langevin differential equations (LDE) of arbitrary order. The fractional order is in terms of ψ-Hilfer fractional operator. This work reveals the dynamical behaviour such as exis...