358 search results - page 44 / 72 » Sparse squares of polynomials |
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper deals with convex relaxations for quadratic distance problems, a class of optimization problems relevant to several important topics in the analysis and synthesis of ro...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
CAEPIA
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
ALGORITHMICA
2010
13 years 7 months ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
AUTOMATICA
2006
13 years 7 months ago
2006
Abstract-- New methods for model validation of continuoustime nonlinear systems with uncertain parameters are presented in this paper. The methods employ functions of state-paramet...