Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
Abstract— In spite of large amount of research work in multiobjective evolutionary algorithms, most have evaluated their algorithms on problems with only two to four objectives. ...
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...
Denis Pallez, Philippe Collard, Thierry Baccino, L...
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...