1986 search results - page 345 / 398 » Path Separability of Graphs |
223
click to vote
DIALM
2004
ACM
16 years 14 days ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
162
click to vote
WS
2004
ACM
16 years 13 days ago
2004
ACM
Title of Thesis: DISTRIBUTED TRUST EVALUATION IN AD-HOC NETWORKS Georgios E. Theodorakopoulos, Master of Science, 2004 Thesis directed by: Professor John S. Baras Department of El...
163
click to vote
CSL
2004
Springer
16 years 13 days ago
2004
Springer
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition gr...
184
click to vote
ICALP
2004
Springer
16 years 12 days ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
199
Voted
RULEML
2004
Springer
16 years 11 days ago
2004
Springer
In this paper we present R-DEVICE, a deductive rule language for reasoning about RDF metadata. R-DEVICE includes features such as normal and generalized path expressions, stratifie...