390 search results - page 41 / 78 » Use It or Lose It |
ASIAN
2006
Springer
14 years 23 days ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
AAAI
2008
13 years 11 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
EDBT
2008
ACM
13 years 10 months ago
2008
ACM
The goal of the Semantic Web is to support semantic interoperability between applications exchanging data on the web. The idea heavily relies on data being made available in machi...
MASCOTS
2008
13 years 10 months ago
2008
We evaluate the reliability of storage system schemes consisting of an equal numbers of data disks and parity disks where each parity disk contains the exclusive or (XOR) of two o...
AIML
2006
13 years 10 months ago
2006
In [9] we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complet...