331 search results - page 18 / 67 » Approximation Algorithms for Connected Dominating Sets |
122
click to vote
SEAL
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Paret...
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
113
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
101
click to vote
GECCO
2008
Springer
15 years 24 days ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
TNN
1998
14 years 11 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...