论文信息 - Genetic algorithms with exons and introns for the satisfiability problem

Genetic algorithms with exons and introns for the satisfiability problem

In this paper we propose a new model of genetic algorithms. This model uses notions of exons and introns. We consider the satisfiability problem as a testbed for a genetic algorithm with exons and introns.

Vladimir Popov

[1] A. Gorbenko,et al. The Longest Common Subsequence Problem , 2012 .

[2] Andrey Sheka,et al. Robot Self-Awareness: Exploration of Internal States , 2012 .

[3] Vladimir Yu. Popov,et al. The set of parameterized k-covers problem , 2012, Theor. Comput. Sci..

[4] Anna Gorbenko,et al. SAT Solvers for the Problem of Sensor Placement , 2012 .

[5] Anna Gorbenko,et al. Planning for Modular Robots , 2012 .

[6] W. Gilbert. Why genes in pieces? , 1978, Nature.

[7] Anna Gorbenko,et al. Task-resource scheduling problem , 2012, International Journal of Automation and Computing.

[8] Anna Gorbenko,et al. Computational Experiments for the Problem of Selection of a Minimal Set of Visual Landmarks , 2012 .

[9] Andrey Sheka,et al. Localization on Discrete Grid Graphs , 2012 .