2740 search results - page 118 / 548 » Approximating Component Selection |
137
click to vote
FOGA
2011
14 years 1 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
121
click to vote
ESANN
2006
14 years 11 months ago
2006
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
158
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
94
Voted
SSDBM
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available space, precluding exact processing. Selective evi...
SCCC
2003
IEEE
15 years 3 months ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...