2244 search results - page 32 / 449 » A new heuristic approach for non-convex optimization problem... |
173
click to vote
AAAI
2006
15 years 7 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
198
click to vote
IJCV
2011
15 years 1 months ago
2011
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
157
Voted
AAAI
2011
14 years 6 months ago
2011
The conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We in...
166
click to vote
SIAMSC
2008
15 years 6 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
164
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
In this paper, we propose two new support vector approaches for ordinal regression, which optimize multiple thresholds to define parallel discriminant hyperplanes for the ordinal ...