9842 search results - page 1391 / 1969 » The Complexity of the Matching-Cut Problem |
231
click to vote
CEC
2009
IEEE
15 years 12 months ago
2009
IEEE
—This paper applies the Differential Evolution (DE) algorithm to the task of automatic fuzzy clustering in a Multi-objective Optimization (MO) framework. It compares the performa...
205
click to vote
COMPGEOM
2009
ACM
15 years 12 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
219
click to vote
COMPGEOM
2009
ACM
15 years 12 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
173
click to vote
ICANN
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
191
click to vote
IFIP
2001
Springer
15 years 11 months ago
2001
Springer
The overall purpose of this paper is to demonstrate the relevance of semiotics concepts to the analysis of intelligent control systems. Semiotics has only a minor impact on resear...