11740 search results - page 131 / 2348 » More Problems in Rewriting |
80
Voted
ICCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...
SAS
2005
Springer
15 years 6 months ago
2005
Springer
The termination insensitive secure information flow problem can be reduced to solving a safety problem via a simple program transformation. Barthe, D’Argenio, and Rezk coined th...
154
click to vote
TAINN
2005
Springer
15 years 6 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
105
Voted
VRST
2000
ACM
15 years 5 months ago
2000
ACM
The need for a real-world driving problem to guide technology development has long been recognised. However, this does not guarantee the identification of requirements for technol...
87
Voted
CORR
2006
Springer
15 years 25 days ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...