The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...
Speciation is an important concept in evolutionary computation. It refers to an enhancements of evolutionary algorithms to generate a set of diverse solutions. The concept is stud...
This paper discusses interactive evolutionary algorithms and their application in swarm-based image generation. From an artist’s perspective, the computer-generated patterns oï¬...
Namrata Khemka, Scott Novakowski, Gerald Hushlak, ...