loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
11th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems (ECBS'04)
Advanced Bayesian Optimization Algorithms Applied in Decomposition Problems
Brno, Czech Republic
May 24-May 27
ISBN: 0-7695-2125-8
Josef Schwarz, Brno University of Technology, CZ
Jir? Ocen?sek, Swiss Federal Institute of Technology (ETH), Switzerland
Jir? Jaros, Brno University of Technology, CZ
This paper deals with the usage of Bayesian optimization algorithm (BOA) and its advanced variants for solving complex NP-complete combinatorial optimization problems. We focus on the hypergraph-partitioning problem and multiprocessor scheduling problem, which belong to the class of frequently solved decomposition tasks. One of the goals is to use these problems to experimentally compare the performance of the recently proposed Mixed Bayesian Optimization Algorithm (MBOA) with the performance of several other evolutionary algorithms based on the estimation and sampling of probabilistic model. We also propose the utilization of prior knowledge about the structure of hypergraphs and task graphs to increase the convergence speed and the quality of solutions. The performance of knowledge based MBOA (KMBOA) algorithms on the multiprocessor scheduling problem is empirically investigated and confirmed.
Citation:
Josef Schwarz, Jir? Ocen?sek, Jir? Jaros, "Advanced Bayesian Optimization Algorithms Applied in Decomposition Problems," ecbs, pp.102, 11th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems (ECBS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.