Buscar
Mostrando ítems 61-70 de 2478
e-Work based collaborative optimization approach for strategic logistic network design problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2009)
We propose a collaborative e-Work based optimization approach for assisting the strategic logistic network design problem, which considers fleet design and customer clustering decisions. Normally, fleet design and customer ...
ICE: A visual analytic tool for interactive clustering ensembles generation
(Association for Computing MachineryPE, 2021)
"Clustering methods are the most used algorithms for unsupervised learning. However, there is no unique optimal approach for all datasets since different clustering algorithms produce different partitions. To overcome this ...
A comparison about evolutionary algorithms for optimum-path forest clustering optimization
(2013)
In this paper we deal with the problem of boosting the Optimum-Path Forest (OPF) clustering approach using evolutionary-based optimization techniques. As the OPF classifier performs an exhaustive search to find out the ...
The detection of spatial clusters: graph and dynamic programming based methods
(Universidade Federal de Minas GeraisUFMG, 2011-07-01)
This thesis addresses the spatial and space-time cluster detection problem. Two algorithms to solve the typical problem for spatial data sets are proposed. A fast method for the detection and inference of point data set ...
Nuevas técnicas de particionamiento en clasificación automáticaNuevas técnicas de particionamiento en clasificación automática
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 1999)
Time-Energy Optimal Cluster Space Motion Planning for Mobile Robot Formations
(IntechOpen, 2016)
The motions of a formation of mobile robots along predetermined paths are optimized according to a tunable time-energy cost function using the cluster space approach to multiagent system specification and control. Upon ...
Complexity of the cluster deletion problem on subclasses of chordal graphs
(Elsevier Science, 2015-10)
We consider the following vertex-partition problem on graphs, known as the CLUSTER DELETION (CD) problem: given a graph with real nonnegative edge weights, partition the vertices into clusters (in this case, cliques) to ...
A complex networks approach for data clustering
(ELSEVIER SCIENCE BVAMSTERDAM, 2012)
This work proposes a method for data clustering based on complex networks theory. A data set is represented as a network by considering different metrics to establish the connection between each pair of objects. The clusters ...
Proper motions of the optically visible open clusters based on the UCAC4 catalog
(EDP SciencesLes Ulis, 2014)
We present a catalog of mean proper motions and membership probabilities of individual stars for optically visible open clusters,
which have been determined using data from the UCAC4 catalog in a homogeneous way. The mean ...