75 search results - page 1 / 15 » Using DNA to solve the Bounded Post Correspondence Problem |
MCU
1998
13 years 6 months ago
1998
TCS
2002
13 years 4 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
SIGECOM
2008
ACM
13 years 4 months ago
2008
ACM
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
MP
2002
13 years 4 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...