• No se han encontrado resultados

Near-optimal continuous patrolling with teams of mobile information gathering agents

N/A
N/A
Protected

Academic year: 2020

Share "Near-optimal continuous patrolling with teams of mobile information gathering agents"

Copied!
43
0
0

Texto completo

Loading

Referencias

Documento similar

We recently introduced the negentropy increment, a validity index for crisp clustering that quantifies the average normality of the clustering partitions using the negentropy.

Input dataset: can either be a list of objects with measured properties, or a distance matrix that represents pair-wise distances between objects. What happens if we have an outlier

Together  these  data  indicate  that  pre-­‐‑TCR  clustering  optimizes  the  receptor  signalling   capacities  and  that  the  transmembrane  region  of  the

In order to check the perfor- mance of the proposed algorithm, we have compared it against well-known clustering algorithms SC (Spectral Clustering) and [12] and K-means [9], as well

We show that, when the real clusters are normally distributed, all the criteria are able to correctly assess the number of components, with AIC and BIC allowing a higher

There is no synchronization in the activity of these neurons: there are several epochs in which neuron a 6 remains silent whereas neuron b 6 is active; However, tran-

To create genetic graph-based clustering algorithms and heuristics to improve the robustness and solutions of classical partitional clustering algorithms, and to study its

Compared to participants in the lower tertile of HbA1c, those in the upper tertile had a higher prevalence of all diagnostic criteria for the metabolic syndrome, their clustering in