Results 1  10
of
1,761,780
nonnegative linear cost functions
, 2008
"... Abstract We consider a quadratic programming (QP) problem () of the form min xT Cx subject to Ax ≥ b, x ≥ 0 where C ∈ Rn×n+, rank(C) = 1 and A ∈ R m×n, b ∈ Rm. We present an fully polynomial time approximation scheme (FPTAS) for this problem by reformulating the QP () as a parameterized LP and “rou ..."
Abstract
 Add to MetaCart
to problems for which the convex hull of the dominant of the feasible integer solutions is known such as s, tshortest paths and s, tmincuts. For the above discrete problems, the quadratic program models the problem of obtaining an integer solution that minimizes the product of two linear nonnegative cost
Sparse dynamic programming I: Linear cost functions
 J. Assoc. Comp. Mach
, 1992
"... A.bstmct: We consider dynamic programming solutions to a number of different recurrences for sequence comparison and for R ~ A secondary structure prediction. These recurrences are defined over a number of points that is quadratic in the input size; however only a sparse set matters for the result. ..."
Abstract

Cited by 53 (3 self)
 Add to MetaCart
. \Ve give efficient algorithms for these problems. when the weight functions used in the recurrences are taken to be linear. Our algorithms reduce the best known bounds by a factor almost linear in the density of the problems: when the problems are sparse this results in a substantial speedup. In trod
“Optimal ” Hopfield Network for Combinatorial Optimization with Linear Cost Function
"... Hopfield network is presented for many of combinatorial optimization problems with linear cost function. It is proved that a vertex of the network state hypercube is asymptotically stable if and only if it is an optimal solution to the problem. That is, one can always obtain an optimal solution when ..."
Abstract
 Add to MetaCart
Hopfield network is presented for many of combinatorial optimization problems with linear cost function. It is proved that a vertex of the network state hypercube is asymptotically stable if and only if it is an optimal solution to the problem. That is, one can always obtain an optimal solution
Genetic Algorithm for the Transportation Problem with Discontinuous Piecewise Linear Cost Function
, 2006
"... We investigate a transportation problem with discontinuous piecewise linear cost function in this paper. The basic feasible solution for the transportation problem, in which flow bounds on edges are uncertain, is obtained by disaggregating piecewise linear cost function. A genetic algorithm is propo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We investigate a transportation problem with discontinuous piecewise linear cost function in this paper. The basic feasible solution for the transportation problem, in which flow bounds on edges are uncertain, is obtained by disaggregating piecewise linear cost function. A genetic algorithm
A Note on Optimum Allocation with NonLinear Cost Function
"... In this paper we consider the optimum allocation for multivariate sampling with nonlinear cost function –travel cost. The problem of determining the optimum allocations are formulated as Nonlinear Programming Problems, in which each NLPP has a convex objective function and a nonlinear cost constra ..."
Abstract
 Add to MetaCart
In this paper we consider the optimum allocation for multivariate sampling with nonlinear cost function –travel cost. The problem of determining the optimum allocations are formulated as Nonlinear Programming Problems, in which each NLPP has a convex objective function and a nonlinear cost
Parametric Query Optimization for Linear and Piecewise Linear Cost Functions
, 2002
"... The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query optimization (PQO) optimizes a query into a number of candidate plans, each optimal for some region of the parameter s ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query optimization (PQO) optimizes a query into a number of candidate plans, each optimal for some region of the parameter
Pointsto Analysis in Almost Linear Time
, 1996
"... We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a nons ..."
Abstract

Cited by 595 (3 self)
 Add to MetaCart
We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a non
Parallel Numerical Linear Algebra
, 1993
"... We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We illust ..."
Abstract

Cited by 773 (23 self)
 Add to MetaCart
We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 788 (30 self)
 Add to MetaCart
of the bilinear objective function under a monotonicity assumption, the polyhedrality of the solution set of a monotone XLCP, and an error bound result for a nondegenerate XLCP. We also present a finite, sequential linear programming algorithm for solving the nonmonotone XLCP.
Lambertian Reflectance and Linear Subspaces
, 2000
"... We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a wi ..."
Abstract

Cited by 526 (20 self)
 Add to MetaCart
We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a
Results 1  10
of
1,761,780