Ant colony search algorithms for optimal polygonal approximation of plane curves. (Q1403765): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Polygonal approximation by the minimax method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficiently searching a graph by a smell-oriented vertex process / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4692508 / rank | |||
Normal rank | |||
Latest revision as of 09:33, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ant colony search algorithms for optimal polygonal approximation of plane curves. |
scientific article |
Statements
Ant colony search algorithms for optimal polygonal approximation of plane curves. (English)
0 references
4 September 2003
0 references
Polygonal approximation
0 references
Genetic algorithm
0 references
Tabu search
0 references
Ant colony search algorithm
0 references
Local optimal solution
0 references
Global optimal solution
0 references
