Sciweavers

10901 search results - page 158 / 2181
» Approximations in Distributed Optimization
Sort
View
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
16 years 3 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
GECCO
2008
Springer
117views Optimization» more  GECCO 2008»
15 years 7 months ago
An application of a multivariate estimation of distribution algorithm to cancer chemotherapy
Alexander E. I. Brownlee, Martin Pelikan, John A. ...
COCOON
2006
Springer
15 years 10 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
ADCM
2005
79views more  ADCM 2005»
15 years 6 months ago
Flexible piecewise approximations based on partition of unity
In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally sm...
Weimin Han, Wing Kam Liu
AUTOMATICA
2004
122views more  AUTOMATICA 2004»
15 years 6 months ago
Approximate explicit receding horizon control of constrained nonlinear systems
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
Tor Arne Johansen