Sciweavers

2743 search results - page 286 / 549
» Minimization of an M-convex Function
Sort
View
172
Voted
EVOW
2008
Springer
15 years 8 months ago
A Study of Some Implications of the No Free Lunch Theorem
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
Andrea Valsecchi, Leonardo Vanneschi
APPML
2007
92views more  APPML 2007»
15 years 6 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
CAGD
2005
86views more  CAGD 2005»
15 years 6 months ago
A variational approach to spline curves on surfaces
Given an m-dimensional surface in Rn , we characterize parametric curves in , which interpolate or approximate a sequence of given points pi and minimize a given energy functio...
Helmut Pottmann, Michael Hofer
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
15 years 11 months ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri
COLT
1997
Springer
15 years 11 months ago
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
Dimitris Bertsimas, David Gamarnik, John N. Tsitsi...