Sciweavers

16883 search results - page 336 / 3377
» Generalized Non-Reducible Descriptors
Sort
View
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 10 months ago
The no free lunch and realistic search algorithms
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, ...
Yossi Borenstein, Riccardo Poli
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
15 years 10 months ago
Applicability issues of the real-valued negative selection algorithms
The paper examines various applicability issues of the negative selection algorithms (NSA). Recently, concerns were raised on the use of NSAs, especially those using real-valued r...
Zhou Ji, Dipankar Dasgupta
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
15 years 10 months ago
"Optimal" mutation rates for genetic search
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
Jorge Cervantes, Christopher R. Stephens
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 10 months ago
gLINC: identifying composability using group perturbation
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
David Jonathan Coffin, Christopher D. Clack
154
Voted
ACMIDC
2010
15 years 10 months ago
Digital inclusion in Chilean in rural schools
This paper analyzes conditions for improving digital inclusion in Chilean rural schools, using a multidimensional definition of digital divide. Using qualitative and quantitative ...
Jaime Sánchez