706 search results - page 127 / 142 » On a quasi-ordering on Boolean functions |
COCO
2008
Springer
13 years 9 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
SEBD
2007
13 years 9 months ago
2007
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
APBC
2004
13 years 9 months ago
2004
Boolean models of genetic regulatory networks (GRNs) have been shown to exhibit many of the characteristic dynamics of real GRNs, with gene expression patterns settling to point a...
CISST
2003
13 years 9 months ago
2003
The unique human expertise in imagery analysis should be preserved and shared with other imagery analysts to improve image analysis and decision-making. Such knowledge can serve a...
ETS
2010
IEEE
13 years 8 months ago
2010
IEEE
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...