Sciweavers

16093 search results - page 41 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
CHINAF
2011
14 years 5 months ago
Immigrant schemes for evolutionary algorithms in dynamic environments: Adapting the replacement rate
One approach for evolutionary algorithms (EAs) to address dynamic optimization problems (DOPs) is to maintain diversity of the population via introducing immigrants. So far all imm...
Xin Yu, Ke Tang, Xin Yao
ICTAI
2007
IEEE
15 years 7 months ago
Ant Colony Optimization for Multi-Objective Optimization Problems
We propose in this paper a generic algorithm based on Ant Colony Optimization to solve multi-objective optimization problems. The proposed algorithm is parameterized by the number...
Inès Alaya, Christine Solnon, Khaled Gh&eac...
SIAMCOMP
2011
14 years 8 months ago
Self-Improving Algorithms
We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an arbitrary, unknown input distribution. We gi...
Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, ...
ACIIDS
2012
IEEE
331views Database» more  ACIIDS 2012»
13 years 9 months ago
Quad Countries Algorithm (QCA)
This paper introduces an improved evolutionary algorithm based on the Imperialist Competitive Algorithm (ICA), called Quad Countries Algorithm (QCA). The Imperialist Competitive Al...
M. A. Soltani-Sarvestani, Shahriar Lotfi, Fatemeh ...
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 3 months ago
The shifting sands algorithm
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
Andrew McGregor, Paul Valiant