61 search results - page 12 / 13 » Pointed binary encompassing trees: Simple and optimal |
GECCO
2003
Springer
14 years 21 days ago
2003
Springer
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
RSA
2010
13 years 5 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
ASIAN
2004
Springer
13 years 11 months ago
2004
Springer
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...