99 search results - page 7 / 20 » Efficiently evaluating complex boolean expressions |
SIGMOD
2010
ACM
13 years 2 months ago
2010
ACM
Probabilistic processes appear naturally in various contexts, with applications to Business Processes, XML data management and more. Many models for specifying and querying such p...
AOIS
2003
13 years 8 months ago
2003
In this paper, we improve and extend the MaSE methodology to bridge the gaps in this methodology. First, we propose an improvement process and, based on this process, we report th...
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
BMCBI
2010
13 years 7 months ago
2010
Background: Several tools have been developed to explore and search Gene Ontology (GO) databases allowing efficient GO enrichment analysis and GO tree visualization. Nevertheless,...
PE
2002
Springer
13 years 7 months ago
2002
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...