We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
The rapid transit network design problem consists on the location of the train alignments and stations in an urban traffic context. The location problem incorporates the demand dec...
In this paper we propose a Monotonic Basin Hopping approach and its population-based variant Population Basin Hopping to solve the problem of packing equal and unequal circles wit...
Andrea Grosso, A. R. M. J. U. Jamali, Marco Locate...
We put forward a methodological approach aimed at guiding ontology modellers in choosing which relations to reify. Our proposal is based on the notion of aggregation as used in con...
We employ statistical methods to analyze, generate, and translate rhythmic poetry. We first apply unsupervised learning to reveal word-stress patterns in a corpus of raw poetry. W...