Sciweavers

77 search results - page 1 / 16
» Mutation Selection: Some Could be Better than All
Sort
View
ENASE
2011
219views Hardware» more  ENASE 2011»
12 years 4 months ago
Mutation Selection: Some Could be Better than All
In previous research, many mutation selection techniques have been proposed to reduce the cost of mutation analysis. After a mutant subset is selected, researchers could obtain a t...
Zhiyi Zhang, Dongjiang You, Zhenyu Chen, Yuming Zh...
AI
2002
Springer
13 years 4 months ago
Ensembling neural networks: Many could be better than all
Neural network ensemble is a learning paradigm where many neural networks are jointly used to solve a problem. In this paper, the relationship between the ensemble and its compone...
Zhi-Hua Zhou, Jianxin Wu, Wei Tang
IJCAI
2007
13 years 5 months ago
Adaptive Genetic Algorithm with Mutation and Crossover Matrices
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the se...
Nga Lam Law, Kwok Yip Szeto
PPSN
2004
Springer
13 years 9 months ago
LS-CMA-ES: A Second-Order Algorithm for Covariance Matrix Adaptation
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
Anne Auger, Marc Schoenauer, Nicolas Vanhaecke
USENIX
1994
13 years 5 months ago
A Better Update Policy
y-filled data block results in a delayed write,Abstract while a modification that fills a block results in an immediate, although asynchronous, write. TheSome file systems can dela...
Jeffrey C. Mogul