Sciweavers

16093 search results - page 340 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
15 years 11 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
CORR
2010
Springer
53views Education» more  CORR 2010»
15 years 7 months ago
Phase-Only Planar Antenna Array Synthesis with Fuzzy Genetic Algorithms
This paper describes a new method for the synthesis of planar antenna arrays using fuzzy genetic algorithms (FGAs) by optimizing phase excitation coefficients to best meet a desir...
Boufeldja Kadri, Miloud Boussahla, Fethi Tarik Ben...
ICML
2006
IEEE
16 years 7 months ago
Algorithms for portfolio management based on the Newton method
We experimentally study on-line investment algorithms first proposed by Agarwal and Hazan and extended by Hazan et al. which achieve almost the same wealth as the best constant-re...
Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. S...
EMO
2005
Springer
194views Optimization» more  EMO 2005»
16 years 10 days ago
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
Michael Emmerich, Nicola Beume, Boris Naujoks
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
15 years 10 months ago
Adaptive discretization for probabilistic model building genetic algorithms
This paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization pro...
Chao-Hong Chen, Wei-Nan Liu, Ying-Ping Chen