339 search results - page 6 / 68 » Universality Results for Models in Locally Boolean Domains |
BIOINFORMATICS
2006
13 years 7 months ago
2006
Motivation: Protein-protein interaction networks are one of the major post-genomic data sources available to molecular biologists. They provide a comprehensive view of the global ...
IJCAI
2007
13 years 9 months ago
2007
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
IDA
2006
Springer
13 years 7 months ago
2006
Springer
Clustering or co-clustering techniques have been proved useful in many application domains. A weakness of these techniques remains the poor support for grouping characterization. ...
AINA
2007
IEEE
13 years 11 months ago
2007
IEEE
In 1957 Crick hypothesized that the genetic code was a comma free code. This property would imply the existence of a universal coding frame and make the set of coding sequences a ...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...