1686 search results - page 296 / 338 » Programs as polygraphs: computability and complexity |
ISSTA
2010
ACM
14 years 11 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
100
click to vote
BIOCOMP
2007
14 years 11 months ago
2007
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
BIOCOMP
2008
14 years 11 months ago
2008
- Here proposed apriori method for identification of protein flexibility relies on one end-state conformation of the protein. This method has comparative advantage over many others...
AVI
2004
14 years 11 months ago
2004
The continuing trend toward greater processing power, larger storage, and in particular increased display surface by using multiple monitor supports increased multi-tasking by the...
DLT
2006
14 years 11 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...