Compact Optimization Algorithms with Re-sampled Inheritance

Compact optimization algorithms are a class of Estimation of Distribution Algorithms (EDAs) characterized by extremely limited memory requirements (hence they are called "compact"). As all EDAs, compact algorithms build and update a probabilistic model of the distribution of solutions within the search space, as opposed to population-based algorithms that instead make use of an explicit population of solutions... (read more)

Results in Papers With Code
(↓ scroll down to see all results)