Comparison of results asynchronous SOMA algorithm that are created in Java and C# programming languages
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F12%3A43868764" target="_blank" >RIV/70883521:28140/12:43868764 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Comparison of results asynchronous SOMA algorithm that are created in Java and C# programming languages
Original language description
SOMA or self-organising migrating algorithm is very effective tool of evolutionary optimisation. There are many strategies of this algorithm. This article presents a comparison of the results of asynchronous parallel version of SOMA algorithm, presumption from AllToOne strategy, that are created in Java and C # programming languages. The first testing took place from viewpoint of dependency of quality (finding of global extreme or approaching to its) of solution on count of used algorithm threads. In the second test there was investigated a time dependency on the count of used threads.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Conference Proceedings XIV. Annual Internetional Conference, Internet, Competitiveness and Organizational Security
ISBN
978-80-7454-142-1
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
71,75
Publisher name
Univerzita Tomáše Bati ve Zlíně, Fakulta aplikované informatiky
Place of publication
Zlín
Event location
Zlín
Event date
Mar 27, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—