11381 search results - page 281 / 2277 » Connectivity |
123
click to vote
FSS
2006
15 years 6 months ago
2006
Abstract. We show a complete axiomatization of unary connectives interpreted by monotone and superdiagonal truth functions, so-called truth-depressing hedges. These connectives for...
200
click to vote
SEFM
2008
IEEE
16 years 29 days ago
2008
IEEE
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad ho...
165
click to vote
CCR
2004
15 years 6 months ago
2004
This paper presents a one-year study of Internet packet traffic from a large campus network, showing that 15-25% of TCP connections have at least one TCP RST (reset). Similar resu...
172
click to vote
GC
2010
Springer
15 years 5 months ago
2010
Springer
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar g...
164
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...