Sciweavers

16093 search results - page 304 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
15 years 10 months ago
Variable Length Genomes for Evolutionary Algorithms
A general variable length genome, called exG, is developed here to address the problems of fixed length representations in canonical evolutionary algorithms. Convergence aspects o...
C.-Y. Lee, E. K. Antonsson
ACL
1990
15 years 8 months ago
Free Indexation: Combinatorial Analysis and a Compositional Algorithm
The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters langua...
Sandiway Fong
CORR
2006
Springer
114views Education» more  CORR 2006»
15 years 6 months ago
Polynomial-time algorithms for coding across multiple unicasts
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
Tracey Ho
CSDA
2004
105views more  CSDA 2004»
15 years 6 months ago
Computational aspects of algorithms for variable selection in the context of principal components
Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...
Jorge Cadima, J. Orestes Cerdeira, Manuel Minhoto
GECCO
2009
Springer
161views Optimization» more  GECCO 2009»
15 years 11 months ago
Benchmarking the BFGS algorithm on the BBOB-2009 noisy testbed
The BFGS quasi-Newton method is benchmarked on the noisy BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of about 104 times the s...
Raymond Ros