A DNA coding scheme for searching stable solutions

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a novel method for searching stable solutions using a DNA coding scheme. Often there is more than one solution that satisfies the system requirements. These solutions can be viewed as extremes in the multimodal function. All extremes are not the same in that some of them are sensitive to noise or perturbation. This paper addresses the method that selects a solution that meets the system requirements in terms of output performance and is tolerant to the perspective noise or perturbation. A new method called a gradient DNA Coding is proposed to achieve such objectives. A numerical example is presented and comparing DNA coding with genetic algorithm is also given. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Kim, I., Lian, H. S., & Kang, H. I. (2005). A DNA coding scheme for searching stable solutions. In Lecture Notes in Computer Science (Vol. 3514, pp. 593–598). Springer Verlag. https://doi.org/10.1007/11428831_73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free