119 search results - page 5 / 24 » Boolean Operations on Feature-based Models |
IPPS
2003
IEEE
14 years 23 days ago
2003
IEEE
In this paper, we consider addressable procedures with DNA strands for logic and arithmetic operations. Using a theoretical model for DNA computing, we first show a DNA represent...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—With the vast increase in collection and storage of data, the problem of data summarization is most critical for effective data management. Since much of this data is categorica...
DLT
2006
13 years 9 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 ...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. This paper is centered on the problem of merging (possibly conflicting) information coming from different sources. Though this problem has attracted much attention in pro...