—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
This paper presents the design and implementation of an adaptive open-set speaker identification system with genetic learning classifier systems. One of the challenging problems i...
WonKyung Park, Jae C. Oh, Misty K. Blowers, Matt B...
Abstract. A model of coevolutioinary genetic algorithms (COGA) consisting of two populations coevolving on two-bit landscapes is investigated in terms of the effects of random par...
Ming Chang, Kazuhiro Ohkura, Kanji Ueda, Masaharu ...
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...