Abstract
This paper discusses the term implicit/orma, which is useful for explaining the behaviour of genetic algorithms. Implicit formae are predicates over the chromosome space that are not strongly connected to the representation at hand but are capable of directing the search. After a short theoretical discussion, three examples are given for illustration, including the subset sum problem which is NP-complete.
Cite
CITATION STYLE
Jelasity, M., & Dombi, J. (1996). Implicit formae in genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1141, pp. 154–163). Springer Verlag. https://doi.org/10.1007/3-540-61723-X_979
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
