2013
DOI: 10.12988/astp.2013.13034
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithms with exons and introns for the satisfiability problem

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
2
2
2

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…Therefore, pretreatment was an essential step of computational modeling before variable selection from the exhaustive data set of descriptors. The classic method of selection of variables based on the theory of evolution of Darwin, wherein various smaller data sets of mutations and crossover studies, finally the offspring, are again correlated with parents, giving the relevant set of descriptors giving crucial information on drugs . The final prediction of phenomenon of particle size was dependent on PLS-DA modeling, wherein computation of the latent variables from the given X -variables and Y as response variable (particle size).…”
Section: Discussionmentioning
confidence: 99%
“…Therefore, pretreatment was an essential step of computational modeling before variable selection from the exhaustive data set of descriptors. The classic method of selection of variables based on the theory of evolution of Darwin, wherein various smaller data sets of mutations and crossover studies, finally the offspring, are again correlated with parents, giving the relevant set of descriptors giving crucial information on drugs . The final prediction of phenomenon of particle size was dependent on PLS-DA modeling, wherein computation of the latent variables from the given X -variables and Y as response variable (particle size).…”
Section: Discussionmentioning
confidence: 99%
“…In particular, we have used algorithms A [1] (see [24]), A [2] (see [25]), A [3] (see [26]), A [4] (see [27]), A [5] (see [28]), A [6] (see [29]) for the satisfiability problem.…”
Section: Computational Experiments For Satisfiability Algorithmsmentioning
confidence: 99%
“…Also, we consider A1 GSAT with adaptive score function (see [5]); A2 genetic algorithm with exons and introns (see [6]);…”
Section: Introductionmentioning
confidence: 99%