Sciweavers

16088 search results - page 273 / 3218
» A Mean-Variance Optimization algorithm
Sort
View
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
GECCO
2000
Springer
113views Optimization» more  GECCO 2000»
15 years 10 months ago
A Non-Linear Schema Theorem for Genetic Algorithms
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...
William A. Greene
SWARM
2008
SPRINGER
108views Optimization» more  SWARM 2008»
15 years 6 months ago
A framework of space-time continuous models for algorithm design in swarm robotics
Designing and analyzing self-organizing systems such as robotic swarms is a challenging task even though we have complete knowledge about the robot's interior. It is difficul...
Heiko Hamann, Heinz Wörn