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

Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94) Pub Date : 1994-05-25 DOI:10.1109/ISMVL.1994.302218

B. Becker, R. Drechsler

引用次数: 21

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

多值函数的高效图表示及其在遗传算法中的应用

我们提出了一种新的通用数据结构来表示多值输入、多值输出函数，称为函数图(FG)。有序fg被证明是正则形式。我们研究了一次读取的fg，并证明了类型限制的fg也是正则的。我们使用fg来表示和操作多值集合。它们允许对集合操作进行有效的操作算法，例如并集和交集。详细介绍了遗传算法在遗传算法中的应用。总体由多根FG表示。实验结果表明，这种新的表示方法是非常有效的，并且优于其他的GAs数据结构。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94)

自引率

0.00%

发文量

期刊最新文献

Design of fault-tolerant cellular arrays on multiple-valued logic Synthesis of multi-variable MVL functions using hybrid mode CMOS logic Multiple-valued-input TANT networks Many-valued generalizations of two finite intervals in Post's lattice An algebraic method to decide the deduction problem in many-valued propositional calculus