349 search results - page 61 / 70 » The Finite and the Infinite |
SIGSOFT
2007
ACM
14 years 10 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Equivocation has been widely used as a measure of security after Shannon[10]. For an infinite system such as the wiretap channel defined in [2], equivocation is unbounded and so e...
TABLEAUX
2000
Springer
14 years 1 months ago
2000
Springer
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
RECOMB
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Contemporary inferences about evolution occasionally involve analyzing infinitely large feature spaces, requiring specific algorithmic techniques. We consider parsimony a...
DCC
2007
IEEE
14 years 9 months ago
2007
IEEE
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...