Detail publikace

ACCELERATED BAYESIAN OPTIMIZATION ALGORITHMS FOR ADVANCED HYPERGRAPH PARTITIONING, accepted paper

SCHWARZ, J.; OČENÁŠEK, J. ACCELERATED BAYESIAN OPTIMIZATION ALGORITHMS FOR ADVANCED HYPERGRAPH PARTITIONING, accepted paper. Procceedings of MENDEL 2003. Brno: Faculty of Mechanical Engineering BUT, 2003. p. 133-141. ISBN: 80-214-2411-7.
Název česky
Akcelerované Bayesovské optimalizační algoritmy pro pokročilé dekompozice hypergrafů
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Schwarz Josef, doc. Ing., CSc. (CK-SZZ)
Očenášek Jiří, Ing.
Klíčová slova

Akcelerované Bayesovské optimalizační algoritmy

Abstrakt

The paper summarizes our recent work on the design, analysis and applications of the Bayesian optimization algorithm (BOA) and its advanced accelerated variants for solving complex - sometimes NP-complete - combinatorial optimization problems from circuit design. We review the methods for accelerating BOA for hypergraph-partitioning problem. The first method accelerates the convergence of sequential BOA by utilizing specific knowledge about the optimized problem and the second method is based on the parallel construction of a probabilistic model. In the experimental part we analyze the advantages of acceleration techniques and prove that BOA is able to solve hypergraph partitioning problems reliably, effectively, and without the need for specifying control parameters and encoding schemes as in recombination-based genetic algorithms.

Rok
2003
Strany
133–141
Sborník
Procceedings of MENDEL 2003
ISBN
80-214-2411-7
Vydavatel
Faculty of Mechanical Engineering BUT
Místo
Brno
BibTeX 
@inproceedings{BUT13984,
  author="Josef {Schwarz} and Jiří {Očenášek}",
  title="ACCELERATED BAYESIAN OPTIMIZATION ALGORITHMS FOR ADVANCED HYPERGRAPH PARTITIONING, accepted paper",
  booktitle="Procceedings of MENDEL 2003",
  year="2003",
  pages="133--141",
  publisher="Faculty of Mechanical Engineering BUT",
  address="Brno",
  isbn="80-214-2411-7"
}
Nahoru