319 search results - page 44 / 64 » Robust Solutions in Unstable Optimization Problems |
112
click to vote
ICCV
2003
IEEE
16 years 3 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
105
click to vote
SAC
2005
ACM
15 years 7 months ago
2005
ACM
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
180
Voted
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
The problem of estimating progress for long-running queries has recently been introduced. We analyze the characteristics of the progress estimation problem, from the perspective o...
125
click to vote
CAAN
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
106
click to vote
CP
2010
Springer
15 years 14 days ago
2010
Springer
Abstract. Branch-and-Check, introduced ten years ago, is a generalization of logic-based Benders decomposition. The key extension is to solve the Benders sub-problems at each feasi...