74 search results - page 6 / 15 » Exploiting equalities in polynomial programming |
SAS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
NETWORKS
2010
14 years 10 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
ISSAC
2007
Springer
15 years 5 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 ...
111
click to vote
JCT
2008
14 years 11 months ago
2008
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...