Sciweavers

2899 search results - page 168 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
CASES
2003
ACM
15 years 11 months ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara
168
Voted
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 9 months ago
A method for parameter calibration and relevance estimation in evolutionary algorithms
We present and evaluate a method for estimating the relevance and calibrating the values of parameters of an evolutionary algorithm. The method provides an information theoretic m...
Volker Nannen, A. E. Eiben
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
15 years 11 months ago
Directional self-learning of genetic algorithm
In order to overcome the low convergence speed and prematurity of classical genetic algorithm, an improved method named directional self-learning of genetic algorithm (DSLGA) is p...
Lin Cong, Yuheng Sha, Licheng Jiao, Fang Liu
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 11 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
PR
2008
131views more  PR 2008»
15 years 6 months ago
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
Salvador García, José Ramón C...