5316 search results - page 79 / 1064 » Which Search Problems Are Random |
126
Voted
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
98
Voted
IQ
2007
15 years 2 months ago
2007
Practitioners and researchers often refer to error rates or accuracy percentages of databases. The former is the number of cells in error divided by the total number of cells; the...
113
Voted
IJCAI
2003
15 years 2 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
105
click to vote
WEA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
PPSN
2000
Springer
15 years 4 months ago
2000
Springer
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...