636 search results - page 62 / 128 » Measuring Complexity of Intelligent Machines |
IDEAL
2004
Springer
15 years 3 months ago
2004
Springer
We propose a new feature selection criterion not based on calculated measures between attributes, or complex and costly distance calculations. Applying a wrapper to the output of a...
AAAI
1990
14 years 11 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
CEC
2010
IEEE
14 years 11 months ago
2010
IEEE
Problems in which some entities interact with each other are common in computational intelligence. This scenario, typical for co-evolving artificial-life agents, learning strategie...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
BVAI
2005
Springer
15 years 3 months ago
2005
Springer
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...