144 search results - page 15 / 29 » A Polynomial Time Approximation Scheme for the Square Packin... |
COCOON
2010
Springer
13 years 11 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
STOC
2000
ACM
13 years 12 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
ICALP
2001
Springer
14 years 19 hour ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
RTAS
2006
IEEE
14 years 1 months ago
2006
IEEE
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
COMPSAC
2004
IEEE
13 years 11 months ago
2004
IEEE
Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful ...