Ratio cut hypergraph partitioning using BDD based MBOA optimization algorithm

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F02%3APU36215" target="_blank" >RIV/00216305:26230/02:PU36215 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Ratio cut hypergraph partitioning using BDD based MBOA optimization algorithm
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
—

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)

Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop
ISBN
80-214-2094-4
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
87-96
Publisher name
Faculty of Mechanical Engineering BUT
Place of publication
Brno
Event location
Brno
Event date
Apr 17, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)