Sciweavers

1149 search results - page 21 / 230
» Comparing parameter tuning methods for evolutionary algorith...
Sort
View
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 4 months ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher
89
Voted
ICAISC
2010
Springer
15 years 25 days ago
Do We Need Whatever More Than k-NN?
Abstract. Many sophisticated classification algorithms have been proposed. However, there is no clear methodology of comparing the results among different methods. According to ou...
Miroslaw Kordos, Marcin Blachnik, Dawid Strzempa
CODES
2008
IEEE
15 years 5 months ago
Dynamic tuning of configurable architectures: the AWW online algorithm
Architectures with software-writable parameters, or configurable architectures, enable runtime reconfiguration of computing platforms to the applications they execute. Such dynami...
Chen Huang, David Sheldon, Frank Vahid
CEC
2007
IEEE
15 years 5 months ago
Self-adaptation of mutation distribution in evolutionary algorithms
— This paper proposes a self-adaptation method to control not only the mutation strength parameter, but also the mutation distribution for evolutionary algorithms. For this purpo...
Renato Tinós, Shengxiang Yang
SC
2009
ACM
15 years 5 months ago
Autotuning multigrid with PetaBricks
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
Cy P. Chan, Jason Ansel, Yee Lok Wong, Saman P. Am...