Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Robert Ivo...
In this paper, the selection of a BASE Case was every bit as important as the simulation itself. The production team had been familiar with simulations and had used their results ...
Owing to the great computation complexity of the ME (motion estimation) in video coding, a lot of fast ME algorithms have been proposed in literature. Most of them are designed ba...
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimati...