636 search results - page 23 / 128 » Measuring Complexity of Intelligent Machines |
CEEMAS
2005
Springer
15 years 3 months ago
2005
Springer
Emergence is a widespread notion in complex systems, artificial life and multi-agent systems. In this paper, we try to clarify a specific emergence feature suggested by John Holl...
ICARIS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper presents an immune-inspired adaptable error detection (AED) framework for Automated Teller Machines (ATMs). This framework two levels, one level is local to a ...
74
Voted
ALT
2004
Springer
15 years 6 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
The standard SVM formulation for binary classification is based on the Hinge loss function, where errors are considered not correlated. Due to this, local information in the featu...
ALT
2002
Springer
15 years 6 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...