Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm.
Pietro S. OlivetoDirk SudholtCarsten WittPublished in: Algorithmica (2022)
Keyphrases
- steady state
- tight bounds
- genetic algorithm
- markov chain
- upper bound
- product form
- state dependent
- operating conditions
- explicit expressions
- queue length
- steady states
- heavy traffic
- single server queue
- queueing networks
- lower bound
- stationary distribution
- fluid model
- neural network
- genetic regulatory networks
- machine learning