1182 search results - page 25 / 237 » Iterative Methods in Combinatorial Optimization |
123
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— This paper proposes a novel two-stage optimization method for robust Model Predictive Control (RMPC) with Gaussian disturbance and state estimation error. Since the dis...
102
click to vote
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
101
Voted
SODA
2004
ACM
15 years 3 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
119
click to vote
FOCM
2010
15 years 11 days ago
2010
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
96
Voted
WSC
1998
15 years 3 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...