Bayes-Dirichlet BDD as a probabilistic model for logic functions and evolutionary circuit decomposer
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F02%3APU36216" target="_blank" >RIV/00216305:26230/02:PU36216 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Bayes-Dirichlet BDD as a probabilistic model for logic functions and evolutionary circuit decomposer
Original language description
This paper deals with the k-way ratio cut hypergraph partitioning utilizing the Mixed discrete continuous variant of the Bayesian Optimization Algorithm (mBOA). We have tested our algorithm on three partitioning taxonomies: recursive minimum ratio cut, multi-way minimum ratio cut and recursive minimum cut bisection. We have also derived a new approach for modeling of Boolean functions using binary decision diagrams (BDDs) which are primarily used as a probabilistic model of the mBOA algorithm.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA102%2F02%2F0503" target="_blank" >GA102/02/0503: Parallel performance prediction and tuning</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Mendel 2002
ISBN
80-214-2135-5
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
117-124
Publisher name
Faculty of Mechanical Engineering BUT
Place of publication
Brno
Event location
Brno
Event date
Jun 5, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—