Parallel Computing for Modified Local Search

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25410%2F10%3A39883255" target="_blank" >RIV/00216275:25410/10:39883255 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Parallel Computing for Modified Local Search

Original language description

The paper deals with using modified type of local search algorithm for optimizing some testing functions and one type of graph methods - travelling salesman problem. The effect of modifying of chosen algorithm is shown on travelling salesman problem andon some testing functions. We will try to modify this algorithm by using principles of parallel computing

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

AE - Management, administration and clerical work

OECD FORD branch

—

Project

<a href="/en/project/GPP403%2F10%2FP334" target="_blank" >GPP403/10/P334: GRID technologies for modeling and optimizing of processes in public administration</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Selected Topics in Applied Computer Science

ISBN

978-960-474-231-8

ISSN

—

e-ISSN

—

Number of pages

6

Pages from-to

—

Publisher name

WSEAS Press

Place of publication

Atény

Event location

Iwate

Event date

Oct 4, 2010

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—