Algorithms 56-59. Cluster analysis by the methods of Hubert

J. Kucharczyk

Displaying similar documents to “Algorithms 56-59. Cluster analysis by the methods of Hubert”

Several methods of the reduction of computational complexity.

Sharashidze, G. (2004)

Bulletin of TICMI

Similarity:

Computational experiments with some approximation algorithms for the travelling salesman problem

A. Adrabiński, M. M. Sysło (1983)

Applicationes Mathematicae

Similarity:

Recent developments in computational gene recognition.

Batzoglou, Serafim, Berger, Bonnie, Kleitman, Daniel J., Lander, Eric, Pachter, Lior (1998)

Documenta Mathematica

Similarity:

Scalable algorithms for contact problems with geometrical and material non-linearities

Dobiáš, Jiří, Pták, Svatopluk, Dostál, Zdeněk, Vondrák, Vít

Similarity:

Algorithms for Ham Sandwich Cuts.

J. Matousek, W. Steiger, Chi-Yuan Lo (1994)

Discrete & computational geometry

Similarity:

Experiments with variants of ant algorithms.

Thomas Stützle, Sebastian Linke (2002)

Mathware and Soft Computing

Similarity:

A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally...