975 search results - page 108 / 195 » Locality Optimization for Program Instances |
HEURISTICS
1998
13 years 9 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
BMCBI
2008
13 years 9 months ago
2008
Background: Identification of RNA homologs within genomic stretches is difficult when pairwise sequence identity is low or unalignable flanking residues are present. In both cases...
CONSTRAINTS
2006
13 years 9 months ago
2006
Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop c...
CC
2010
Springer
14 years 4 months ago
2010
Springer
Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...