1651 search results - page 181 / 331 » Measuring the Complexity of Classification Problems |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
ICML
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper presents an approach to automatic discovery of functions in Genetic Programming. The approach is based on discovery of useful building blocks by analyzing the evolution...
FOCM
2007
13 years 8 months ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
BMCBI
2007
13 years 8 months ago
2007
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
ISSTA
2010
ACM
13 years 8 months ago
2010
ACM
Applications that process complex inputs often react in different ways to changes in different regions of the input. Small changes to forgiving regions induce correspondingly smal...