Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study (Q4538537): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PVM / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:16, 5 March 2024
scientific article; zbMATH DE number 1767268
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study |
scientific article; zbMATH DE number 1767268 |
Statements
Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study (English)
0 references
14 July 2002
0 references
genetic algorithm
0 references
parallel virtual machine
0 references
