Efficient graph based representation of multi-valued functions with an application to genetic algorithms

Author

Becker, Bernd ; Drechsler, Rolf

Author_Institution

Dept. of Comput. Sci., Frankfurt Univ., Germany

fYear

1994

fDate

25-27 May 1994

Firstpage

65

Lastpage

72

Abstract

We present a new general data structure for representation of multi-valued input, multi-valued output functions, called function graphs (FG). Ordered FGs are shown to be a canonical form. We investigate read-once FGs and show that type-restricted FGs are also canonical. We use FGs for multi-valued set representation and manipulation. They allow efficient manipulation algorithms for set operations, e.g. union and intersection. An application to genetic algorithms (GAs) is presented in more detail. A population is represented by a multi-rooted FG. It is shown by experimental results that this new representation is very efficient and superior to other data structures for GAs

Keywords

data structures; genetic algorithms; many-valued logics; function graphs; general data structure; genetic algorithms; graph based representation; intersection; manipulation algorithms; multi-valued functions; union; Application software; Boolean functions; Computer science; Data structures; Genetic algorithms; Machine learning; Multivalued logic; NP-complete problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Multiple-Valued Logic, 1994. Proceedings., Twenty-Fourth International Symposium on

Conference_Location

Boston, MA

Print_ISBN

0-8186-5650-6

Type

conf

DOI

10.1109/ISMVL.1994.302218

Filename

302218