A Genetic Algorithm for the Minimization of OPKFDDs(Regular Section)

スポンサーリンク

概要

• 論文の詳細を見る

• OPKFDDs (Ordered Pseudo-Kronecker Functional Decision Diagrams) are a data structure that provides compact representation of Boolean functions. The size of OPKFDDs depends on a variable ordering and on decomposition type choices. Finding an optimal representation is very hard and the size of the search space is n! ・ 3^2n-1, where n is the number of input variables. To overcome the huge search space of the problem, a genetic algorithm is proposed for the generation of OPKFDDs with minimal number of nodes.

• 社団法人電子情報通信学会の論文
• 2002-12-01

著者

• Drechsler Rolf

  Corporate Technology Siemens Ag

• JUNG Migyoung

  Department of Computer Science Chonnam National University

• LEE Gueesang

  Department of Computer Science and the Information & Telecommunication Research Institute Chonnam Na

• PARK Sungju

  School of Electrical Eng & Computer Science Hanyang University

• Lee Gueesang

  Department Of Computer Science And The Information & Telecommunication Research Institute Chonna

• Park Sungju

  School Of Electrical Eng & Computer Science Hanyang University

関連論文

• A Genetic Algorithm for the Minimization of OPKFDDs(Regular Section)
• Text Line Segmentation in Handwritten Document Images Using Tensor Voting
• Proximity Based Object Segmentation in Natural Color Images Using the Level Set Method

スポンサーリンク