Sciweavers

23 search results - page 4 / 5
» Unconstrained Parametric Minimization of a Polynomial: Appro...
Sort
View
SIAMNUM
2010
131views more  SIAMNUM 2010»
13 years 2 months ago
A Rational Interpolation Scheme with Superpolynomial Rate of Convergence
The purpose of this study is to construct a high-order interpolation scheme for arbitrary scattered datasets. The resulting function approximation is an interpolation function when...
Qiqi Wang, Parviz Moin, Gianluca Iaccarino
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
ICRA
2010
IEEE
135views Robotics» more  ICRA 2010»
13 years 5 months ago
Implicit nonlinear complementarity: A new approach to contact dynamics
— Contact dynamics are commonly formulated as a linear complementarity problem. While this approach is superior to earlier spring-damper models, it can be inaccurate due to pyram...
Emanuel Todorov
INFORMS
1998
100views more  INFORMS 1998»
13 years 7 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova