550 search results - page 33 / 110 » Optimization and Approximation Problems Related to Polynomia... |
MOR
2006
13 years 8 months ago
2006
This paper provides guidance for operating an assemble-to-order system to maximize expected discounted profit, assuming that a high volume of prospective customers arrive per unit...
SCIA
2009
Springer
14 years 3 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
ACSD
2007
IEEE
14 years 3 months ago
2007
IEEE
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in...
MP
2008
13 years 8 months ago
2008
We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be dir...
AAECC
2006
Springer
13 years 8 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...