About: Load-balancing of Master-Slave Evolutionary Algorithm for Parameters Identification     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
  • The goal of this paper is to investigate under which settings it is effective to use an asynchronous version of the master-slave model of a population-based optimization algorithm. Both versions, synchronous and asynchronous, are implemented and compared using data from the multi-objective identification of parameters for a material constitutive law for concrete. Results have shown that the synchronous version is preferable for the low number of processors whereas for the high number of available CPUs the asynchronous version is clear winner.
  • The goal of this paper is to investigate under which settings it is effective to use an asynchronous version of the master-slave model of a population-based optimization algorithm. Both versions, synchronous and asynchronous, are implemented and compared using data from the multi-objective identification of parameters for a material constitutive law for concrete. Results have shown that the synchronous version is preferable for the low number of processors whereas for the high number of available CPUs the asynchronous version is clear winner. (en)
Title
  • Load-balancing of Master-Slave Evolutionary Algorithm for Parameters Identification
  • Load-balancing of Master-Slave Evolutionary Algorithm for Parameters Identification (en)
skos:prefLabel
  • Load-balancing of Master-Slave Evolutionary Algorithm for Parameters Identification
  • Load-balancing of Master-Slave Evolutionary Algorithm for Parameters Identification (en)
skos:notation
  • RIV/68407700:21110/09:00157924!RIV10-MPO-21110___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(FT-TA4/100)
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
  • 323965
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21110/09:00157924
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • optimization; parallel evolutionary algorithms; load-balancing; parameters identification; inverse analysis; parallel computing (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [D93F46DE0865]
http://linked.open...v/mistoKonaniAkce
  • Pecs
http://linked.open...i/riv/mistoVydani
  • Stirling
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the First International Conference on Parallel, Distributed and Grid Computing for Engineering
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
  • Lepš, Matěj
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000271452700010
http://linked.open.../riv/zahajeniAkce
issn
  • 1759-3433
number of pages
http://purl.org/ne...btex#hasPublisher
  • Civil-Comp Press Ltd
https://schema.org/isbn
  • 978-1-905088-29-4
http://localhost/t...ganizacniJednotka
  • 21110
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software