Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
SCHWARZ, J., OČENÁŠEK, J.
Originální název
Ratio cut hypergraph partitioning using BDD based MBOA optimization algorithm
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
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.
Klíčová slova
ratio cut partitioning, Bayesian Optimization Algorithm, partitioning taxonomy, hypergraph bisection, decision diagram, decision tree, Boolean function modelling
Autoři
Rok RIV
2002
Vydáno
17. 4. 2002
Nakladatel
Faculty of Informatics and Information Technology STU
Místo
Brno
ISBN
80-214-2094-4
Kniha
Proceedings of IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop
Strany od
87
Strany do
96
Strany počet
10
URL
http://www.fit.vutbr.cz/~schwarz/PDFCLANKY/ddecs02.pdf
BibTex
@inproceedings{BUT10024, author="Josef {Schwarz} and Jiří {Očenášek}", title="Ratio cut hypergraph partitioning using BDD based MBOA optimization algorithm", booktitle="Proceedings of IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop", year="2002", pages="87--96", publisher="Faculty of Informatics and Information Technology STU", address="Brno", isbn="80-214-2094-4", url="http://www.fit.vutbr.cz/~schwarz/PDFCLANKY/ddecs02.pdf" }