465 search results - page 14 / 93 » Optimization Over the Efficient Set of Multi-objective Conve... |
APPROX
2010
Springer
13 years 10 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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
JMLR
2012
11 years 11 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper we deal with two problems which are of great interest in the field of distributed decision making and control. The first problem we tackle is the problem of achieving...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Bloat control is an important aspect of evolutionary computation methods, such as genetic programming, which must deal with genomes of arbitrary size. We introduce three ...