916 search results - page 5 / 184 » Algorithm selection: a quantitative computation-intensive op... |
PPSN
1994
Springer
13 years 11 months ago
1994
Springer
We discuss the use of normal distribution theory as a tool to model the convergence characteristics of di erent GA selection schemes. The models predict the proportion of optimal a...
IPMI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We propose a novel algorithm called graph-shifts for performing image segmentation and labeling. This algorithm makes use of a dynamic hierarchical representation of the ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
PKDD
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
GECCO
2005
Springer
14 years 27 days ago
2005
Springer
This paper proposes a statistical mechanism to analyze the detector coverage in a negative selection algorithm, namely a quantitative measurement of a detector set’s capability ...