1805 search results - page 87 / 361 » A Theory of Closure Operators |
APAL
2010
15 years 4 months ago
2010
Computability theory concerns information with a causal
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We apply the theory of random Schr
125
click to vote
JAIR
2010
15 years 2 months ago
2010
As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a logical domain description cannot be fully automated. Moreover, like any other...
126
click to vote
SIGCOMM
2010
ACM
15 years 4 months ago
2010
ACM
Recent studies have shown that the current primitives for connecting multiple routing protocol instances (OSPF 1, OSPF 2, EIGRP 10, etc.) are pervasively deployed in enterprise ne...
171
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...