Sciweavers

792 search results - page 63 / 159
» Measuring complexity by measuring structure and organization
Sort
View
SAC
2010
ACM
15 years 4 months ago
Feature interaction networks
A quantitative approach for measuring and describing feature interactions in object-oriented software components based on source code inspection is presented. The methodical arsen...
Stefan Sobernig
PAKDD
2007
ACM
158views Data Mining» more  PAKDD 2007»
15 years 4 months ago
Density-Sensitive Evolutionary Clustering
In this study, we propose a novel evolutionary algorithm-based clustering method, named density-sensitive evolutionary clustering (DSEC). In DSEC, each individual is a sequence of ...
Maoguo Gong, Licheng Jiao, Ling Wang, Liefeng Bo
BVAI
2005
Springer
15 years 3 months ago
Algorithm That Mimics Human Perceptual Grouping of Dot Patterns
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
Giuseppe Papari, Nicolai Petkov
AAAI
1998
14 years 11 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
WD
2010
14 years 7 months ago
Centrality-based routing for Wireless Sensor Networks
The use of topological features, more specifically, the importance of an element related to its structural position is a subject widely studied. For instance, complex networks theo...
Eduardo M. R. Oliveira, Heitor S. Ramos, Antonio A...