IMI-BAS
 

BulDML at Institute of Mathematics and Informatics >
ITHEA >
International Book Series Information Science and Computing >
2008 >
Book 1 Algorithmic and Mathematical Foundations of the Artificial Intelligence >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/1005

Title: Implementation of a Heuristic Method of Decomposition of Partial Boolean Functions
Authors: Zakrevskij, Arkadij
Toropov, Nikolai
Keywords: Partial Boolean Functions
Heuristic Method of Decomposition
Combinational Logic
Issue Date: 2008
Publisher: Institute of Information Theories and Applications FOI ITHEA
Abstract: An original heuristic algorithm of sequential two-block decomposition of partial Boolean functions is researched. The key combinatorial task is considered: finding of suitable partition on the set of arguments, i. e. such one, on which the function is separable. The search for suitable partition is essentially accelerated by preliminary detection of its traces. Within the framework of the experimental system the efficiency of the algorithm is evaluated, the boundaries of its practical application are determined.
URI: http://hdl.handle.net/10525/1005
ISSN: 1313-0455
Appears in Collections:Book 1 Algorithmic and Mathematical Foundations of the Artificial Intelligence

Files in This Item:

File Description SizeFormat
IBS-01-p08.pdf123.6 kBAdobe PDFView/Open

 



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2009  The DSpace Foundation - Feedback