Search Results for author:
Found 2 papers, 0 papers with code
A Distribution Evolutionary Algorithm for the Graph Coloring Problem
Unlike existing estimation of distribution algorithms where a probability model is updated by generated solutions, DEA-PPM employs a distribution population based on a novel probability model, and an orthogonal exploration strategy is introduced to search the distribution space with the assistance of an refinement strategy.
Error Analysis of Elitist Randomized Search Heuristics
When globally optimal solutions of complicated optimization problems cannot be located by evolutionary algorithms (EAs) in polynomial expected running time, the hitting time/running time analysis is not flexible enough to accommodate the requirement of theoretical study, because sometimes we have no idea on what approximation ratio is available in polynomial expected running time.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
