In this paper we present a concurrent implementation of genetic algorithms designed for shared memory architectures intended to take advantage of multi-core processor platforms. O...
— Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present a stigmerg...
This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossov...
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 ...
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...