975 search results - page 43 / 195 » Locality Optimization for Program Instances |
107
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
OL
2008
14 years 9 months ago
2008
We introduce the Symmetric Reduction Ansatz at a point from the closure of the feasible set in generalized semi-infinite programming. A corresponding Symmetric Reduction Lemma is s...
WEA
2010
Springer
15 years 4 months ago
2010
Springer
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
DATE
2003
IEEE
15 years 3 months ago
2003
IEEE
The widening gap between processor and memory speeds renders data locality optimization a very important issue in data-intensive embedded applications. Throughout the years hardwa...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...