About: Advanced Bayesian Optimization Algorithms Applied in Decomposition Problems     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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 severall other evolutionary algorithms. BOA algorithms are based on the estimation and sampling of probabilistic model unlike classical genetic algorithms. We also propose the utilization of prior knowledge about the structure of a task graph to increase the convergence speed and the quality of solutions. The performance of KMBOA algorithm on the multiprocessor scheduling problem is empirically investigated and confirmed.
  • 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 severall other evolutionary algorithms. BOA algorithms are based on the estimation and sampling of probabilistic model unlike classical genetic algorithms. We also propose the utilization of prior knowledge about the structure of a task graph to increase the convergence speed and the quality of solutions. The performance of KMBOA algorithm on the multiprocessor scheduling problem is empirically investigated and confirmed. (en)
  • 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 severall other evolutionary algorithms. BOA algorithms are based on the estimation and sampling of probabilistic model unlike classical genetic algorithms. We also propose the utilization of prior knowledge about the structure of a task graph to increase the convergence speed and the quality of solutions. The performance of KMBOA algorithm on the multiprocessor scheduling problem is empirically investigated and confirmed. (cs)
Title
  • Pokročilé Bayesovské optimalizační algoritmy aplikované na dekompoziční problémy (cs)
  • Advanced Bayesian Optimization Algorithms Applied in Decomposition Problems
  • Advanced Bayesian Optimization Algorithms Applied in Decomposition Problems (en)
skos:prefLabel
  • Pokročilé Bayesovské optimalizační algoritmy aplikované na dekompoziční problémy (cs)
  • Advanced Bayesian Optimization Algorithms Applied in Decomposition Problems
  • Advanced Bayesian Optimization Algorithms Applied in Decomposition Problems (en)
skos:notation
  • RIV/00216305:26230/04:PU49180!RIV/2005/GA0/262305/N
http://linked.open.../vavai/riv/strany
  • 102-111
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA102/02/0503)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 553598
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/04:PU49180
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Bayesian optimization algorithm, hypergraph-partitioning problem, multiprocessor scheduling problem, specific problem knowledge (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [AC2CD4E969B8]
http://linked.open...v/mistoKonaniAkce
  • Brno
http://linked.open...i/riv/mistoVydani
  • Los Alamitos
http://linked.open...i/riv/nazevZdroje
  • Proceedings of ECBS 2004
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Jaroš, Jiří
  • Schwarz, Josef
  • Očenášek, Jiří
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • IEEE Computer Society
https://schema.org/isbn
  • 0-7695-2125-8
http://localhost/t...ganizacniJednotka
  • 26230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 47 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software