Abstract: The traveling salesman problem (TSP) is one of many well-known combinatorial problems. TSP could be ex-plained as difficulty of finding the shortest distance to travel from the first city, ...
Abstract: The compact genetic algorithm (cGA) is one of the simplest estimation-of-distribution algorithms (EDAs). Next to the univariate marginal distribution algorithm (UMDA)– another simple EDA–, ...
For the last few years or so, the story in the artificial intelligence that was accepted without question was that all of the big names in the field needed more compute, more resources, more energy, ...
Creative Commons (CC): This is a Creative Commons license. Attribution (BY): Credit must be given to the creator. We present an artificial intelligence-guided approach to design durable and chemically ...
ABSTRACT: An intelligent crossover methodology within the genetic algorithm (GA) is explored within both mathematical and finite element arenas improving both design and solution convergence time.
ABSTRACT: An intelligent crossover methodology within the genetic algorithm (GA) is explored within both mathematical and finite element arenas improving both design and solution convergence time.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results