989 search results - page 22 / 198 » Approximating the Pareto optimal set using a reduced set of ... |
MASCOTS
2007
13 years 9 months ago
2007
Abstract— Wireless Mesh Networks are a scalable and costeffective solution for next-generation wireless networking. In the present work, we consider the Round Weighting Problem (...
ACMICEC
2003
ACM
14 years 1 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
FOGA
2011
12 years 11 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...