Sciweavers

16093 search results - page 89 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
WSC
2007
15 years 3 months ago
Extension of the direct optimization algorithm for noisy functions
DIRECT (DIviding RECTangles) is a deterministic global optimization algorithm for bound-constrained problems. The algorithm, based on a space-partitioning scheme, performs both gl...
Geng Deng, Michael C. Ferris
RANDOM
1999
Springer
15 years 5 months ago
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
Seth Pettie, Vijaya Ramachandran
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 7 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
EMO
2006
Springer
173views Optimization» more  EMO 2006»
15 years 5 months ago
Differential Evolution versus Genetic Algorithms in Multiobjective Optimization
This paper presents a comprehensive comparison between the performance of state-of-the-art genetic algorithms NSGA-II, SPEA2 and IBEA and their differential evolution based variant...
Tea Tusar, Bogdan Filipic
CEC
2010
IEEE
15 years 2 months ago
A Mean-Variance Optimization algorithm
A new stochastic optimization algorithm referred to by the authors as the `Mean-Variance Optimization' (MVO) algorithm is presented in this paper. MVO falls into the category ...
Istvan Erlich, Ganesh K. Venayagamoorthy, Nakawiro...